Uniform price auctions: equilibria and efficiency

DOI10.1007/s00224-014-9537-9zbMath1327.91036OpenAlexW2096109742MaRDI QIDQ904682

Evangelos Markakis, Orestis A. Telelis

Publication date: 13 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9537-9

zbMATH Keywords

price of anarchyuniform price auctionBayes-Nash equilibriumsubmodular valuation functions

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Pricing multi-unit markets, Item bidding for combinatorial public projects, Tight welfare guarantees for pure Nash equilibria of the uniform price auction, Algorithms as Mechanisms: The Price of Anarchy of Relax and Round, The Pareto frontier of inefficiency in mechanism design

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-unit auctions with uniform prices
• Equilibria in a multi-object uniform price sealed bid auction with multi- unit demands
• Bounding the inefficiency of outcomes in generalized second price auctions
• Combinatorial auctions with decreasing marginal utilities
• Truthful approximation mechanisms for restricted combinatorial auctions
• The curse of simultaneity
• On the Existence of Pure and Mixed Strategy Nash Equilibria in Discontinuous Games
• On Maximizing Welfare When Utility Functions Are Subadditive
• Mechanisms for Multi-Unit Auctions
• Simultaneous auctions are (almost) efficient
• Composable and efficient mechanisms
• Bayesian Combinatorial Auctions