Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/62658 
Year of Publication: 
2008
Series/Report no.: 
Working Paper No. 2008-13
Publisher: 
Brown University, Department of Economics, Providence, RI
Abstract: 
Starting with an initial price vector, prices are adjusted in order to eliminate the demand excess and at the same time to keep the transfers to the sellers as low as possible. In each step of the auction, to which sellers should those transfers be made (minimal overdemanded sets) is the key definition in the description of the algorithm. Such approach was previously used by several authors. We introduce a novel distinction by considering multiple sellers owing multiple identical objects and multiple buyers with a quota greater than one consuming at most one unit of each seller's good. This distinction induces a necessarily more complicated construction of the overdemanded sets than the constructions existing in the literature, even in the simplest case of additive utilities considered here. As the previous papers, our mechanism yields the minimum competitive equilibrium price vector. A procedure to find the maximum competitive equilibrium price vector is also provided.
Subjects: 
matching
stable payoff
competitive equilibrium payoff
optimal stable payoff
lattice
JEL: 
C78
D78
Document Type: 
Working Paper

Files in This Item:
File
Size
314.75 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.