This paper presents an auction procedure which is of particular interest when short execution times are of importance. It is based on a method for approximating the bidders' preferences over two types of items when complementarity between the two may exist. In particular, linear approximations of the bidders' indifference curves are made. The resulting approximated preference relation is shown to be complete and transitive at any given price vector. It is shown that an approximated Walrasian equilibrium always exists if the approximated preferences of the bidders comply with the gross substitutes condition. Said condition also ensures that the set of approximated equilibrium prices forms a complete lattice. A process is proposed which is sh...
We consider the market value of excess demand as a measure of disequilibrium. We show that, in a fix...
We study a fundamental problem in micro economics called optimal auction design: A seller wishes to ...
Combinatorial auctions are auction formats that allow agents to submit single bids for a set of dist...
This paper presents a combinatorial auction, which is of particular interest when short completion t...
Abstract. We consider a social optimization model of pricing scheme in single-minded auctions, in ca...
AbstractWe consider a social optimization model of pricing scheme in single-minded auctions, in case...
In an auction market where the price of each selling item is restricted to an admissible interval (p...
We consider the Arrow-Debreu exchange market model where agents' demands satisfy the weak gross subs...
The goal of an auction is to determine commodity prices such that all participants are perfectly hap...
Dynamic auctions are trading mechanisms for discovering market-clearing prices and efficient allocat...
In this work, we design simple and ecient iterative auctions for selling multiple items in settings ...
We address the problem of computing a Walrasian equilibrium price in an ascending auction with gross...
Abstract We exhibit three approximation algorithms for the allocation problem in combinatorial aucti...
We show that a profit maximizing monopolistic intermediary may behave approximately like a Walrasian...
This paper identifies two notions of substitutes for auction and equilibrium anal-ysis. Weak substit...
We consider the market value of excess demand as a measure of disequilibrium. We show that, in a fix...
We study a fundamental problem in micro economics called optimal auction design: A seller wishes to ...
Combinatorial auctions are auction formats that allow agents to submit single bids for a set of dist...
This paper presents a combinatorial auction, which is of particular interest when short completion t...
Abstract. We consider a social optimization model of pricing scheme in single-minded auctions, in ca...
AbstractWe consider a social optimization model of pricing scheme in single-minded auctions, in case...
In an auction market where the price of each selling item is restricted to an admissible interval (p...
We consider the Arrow-Debreu exchange market model where agents' demands satisfy the weak gross subs...
The goal of an auction is to determine commodity prices such that all participants are perfectly hap...
Dynamic auctions are trading mechanisms for discovering market-clearing prices and efficient allocat...
In this work, we design simple and ecient iterative auctions for selling multiple items in settings ...
We address the problem of computing a Walrasian equilibrium price in an ascending auction with gross...
Abstract We exhibit three approximation algorithms for the allocation problem in combinatorial aucti...
We show that a profit maximizing monopolistic intermediary may behave approximately like a Walrasian...
This paper identifies two notions of substitutes for auction and equilibrium anal-ysis. Weak substit...
We consider the market value of excess demand as a measure of disequilibrium. We show that, in a fix...
We study a fundamental problem in micro economics called optimal auction design: A seller wishes to ...
Combinatorial auctions are auction formats that allow agents to submit single bids for a set of dist...