Abstract
We consider discriminatory auctions for multiple identical units of a good. Players have private values, possibly for multiple units. None of the usual assumptions about symmetry of players' distributions over values or symmetry of equilibrium play are made. Because of this, equilibria will typically involve inefficient allocations. Equilibria also become very difficult to solve for. Using an approach which does not depend on explicit equilibrium calculations we show that such auctions become arbitrarily close to efficient as the number of players, and possibly the number of objects, grows large, and provide a simple characterization of limit equilibria.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
