Adjusting Prices in the Many-to-many Assignment Game
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.
|Date of creation:||2008|
|Contact details of provider:|| Postal: Department of Economics, Brown University, Providence, RI 02912|
When requesting a correction, please mention this item's handle: RePEc:bro:econwp:2008-12. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Brown Economics Webmaster)
If references are entirely missing, you can add them using this form.