Composable and efficient mechanisms

From MaRDI portal
Revision as of 04:06, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5495791

DOI10.1145/2488608.2488635zbMath1293.91091arXiv1211.1325OpenAlexW2115276154MaRDI QIDQ5495791

Vasilis Syrgkanis, Éva Tardos

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



Related Items

Multi-Item Nontruthful Auctions Achieve Good RevenueOn the Efficiency of the Proportional Allocation Mechanism for Divisible ResourcesPrincipal-agent VCG contractsOn the Efficiency of All-Pay MechanismsOn the stability of generalized second price auctions with budgetsTowards a characterization of worst case equilibria in the discriminatory price auctionLearning in auctions: regret is hard, envy is easyBest-response dynamics in combinatorial auctions with item biddingOnline Submodular Welfare Maximization: Greedy Beats 1/2 in Random OrderInterconnected pay-as-bid auctionsLimits of Efficiency in Sequential AuctionsOptimal Cost-Sharing in General Resource Selection GamesCorrelated and Coarse Equilibria of Single-Item AuctionsSmoothness for Simultaneous Composition of Mechanisms with AdmissionApproximating Gains-from-Trade in Bilateral TradingSimultaneous 2nd price item auctions with no-underbiddingUniform price auctions: equilibria and efficiencyInefficiency of games with social contextIndependent learning in stochastic gamesSimultaneous auctions without complements are (almost) efficientA note on the efficiency of position mechanisms with budget constraintsPrice of Anarchy for Mechanisms with Risk-Averse AgentsProphet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic InputsWelfare guarantees for proportional allocationsOn the efficiency of the proportional allocation mechanism for divisible resourcesOn the efficiency of all-pay mechanismsItem bidding for combinatorial public projectsBounding the inefficiency of outcomes in generalized second price auctionsTight welfare guarantees for pure Nash equilibria of the uniform price auctionEquilibria of Greedy Combinatorial AuctionsSimple combinatorial auctions with budget constraintsUnnamed ItemMechanism design for perturbation stable combinatorial auctionsExpressiveness and Robustness of First-Price Position AuctionsGame efficiency through linear programming dualityItem Pricing for Combinatorial Public ProjectsAlgorithms as Mechanisms: The Price of Anarchy of Relax and RoundThe Pareto frontier of inefficiency in mechanism designThe Efficiency of Resource Allocation Mechanisms for Budget-Constrained UsersAn $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions