Composable and efficient mechanisms
From MaRDI portal
Publication:5495791
DOI10.1145/2488608.2488635zbMath1293.91091arXiv1211.1325OpenAlexW2115276154MaRDI QIDQ5495791
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.1325
Special types of economic equilibria (91B52) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
Multi-Item Nontruthful Auctions Achieve Good Revenue ⋮ On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources ⋮ Principal-agent VCG contracts ⋮ On the Efficiency of All-Pay Mechanisms ⋮ On the stability of generalized second price auctions with budgets ⋮ Towards a characterization of worst case equilibria in the discriminatory price auction ⋮ Learning in auctions: regret is hard, envy is easy ⋮ Best-response dynamics in combinatorial auctions with item bidding ⋮ Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order ⋮ Interconnected pay-as-bid auctions ⋮ Limits of Efficiency in Sequential Auctions ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Correlated and Coarse Equilibria of Single-Item Auctions ⋮ Smoothness for Simultaneous Composition of Mechanisms with Admission ⋮ Approximating Gains-from-Trade in Bilateral Trading ⋮ Simultaneous 2nd price item auctions with no-underbidding ⋮ Uniform price auctions: equilibria and efficiency ⋮ Inefficiency of games with social context ⋮ Independent learning in stochastic games ⋮ Simultaneous auctions without complements are (almost) efficient ⋮ A note on the efficiency of position mechanisms with budget constraints ⋮ Price of Anarchy for Mechanisms with Risk-Averse Agents ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Welfare guarantees for proportional allocations ⋮ On the efficiency of the proportional allocation mechanism for divisible resources ⋮ On the efficiency of all-pay mechanisms ⋮ Item bidding for combinatorial public projects ⋮ Bounding the inefficiency of outcomes in generalized second price auctions ⋮ Tight welfare guarantees for pure Nash equilibria of the uniform price auction ⋮ Equilibria of Greedy Combinatorial Auctions ⋮ Simple combinatorial auctions with budget constraints ⋮ Unnamed Item ⋮ Mechanism design for perturbation stable combinatorial auctions ⋮ Expressiveness and Robustness of First-Price Position Auctions ⋮ Game efficiency through linear programming duality ⋮ Item Pricing for Combinatorial Public Projects ⋮ Algorithms as Mechanisms: The Price of Anarchy of Relax and Round ⋮ The Pareto frontier of inefficiency in mechanism design ⋮ The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users ⋮ An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions