Publication:5365074

From MaRDI portal


zbMath1377.91102MaRDI QIDQ5365074

Kshipra Bhawalkar, Tim Roughgarden

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133091


91B52: Special types of economic equilibria

91B26: Auctions, bargaining, bidding and selling, and other market models


Related Items

Unnamed Item, Worst-Case Mechanism Design via Bayesian Analysis, Algorithms as Mechanisms: The Price of Anarchy of Relax and Round, Expressiveness and Robustness of First-Price Position Auctions, Game efficiency through linear programming duality, Unnamed Item, Unnamed Item, Tight welfare guarantees for pure Nash equilibria of the uniform price auction, Equilibria of Greedy Combinatorial Auctions, Risk-free bidding in complement-free combinatorial auctions, An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions, On the Complexity of Equilibrium Computation in First-Price Auctions, Unnamed Item, Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem, Simultaneous 2nd price item auctions with no-underbidding, Welfare guarantees for proportional allocations, On the efficiency of the proportional allocation mechanism for divisible resources, Item bidding for combinatorial public projects, Uniform price auctions: equilibria and efficiency, Repeated budgeted second price ad auction, On the efficiency of all-pay mechanisms, Stability and auctions in labor markets with job security, Simple combinatorial auctions with budget constraints, 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, Simultaneous auctions without complements are (almost) efficient, Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents, Bounding the inefficiency of outcomes in generalized second price auctions, Economic efficiency requires interaction, Computing a small agreeable set of indivisible items, Fair allocation of indivisible goods: beyond additive valuations, Item Pricing for Combinatorial Public Projects, Limits of Efficiency in Sequential Auctions, Correlated and Coarse Equilibria of Single-Item Auctions, Smoothness for Simultaneous Composition of Mechanisms with Admission, Approximating Gains-from-Trade in Bilateral Trading, Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs, Cost-Sharing Models in Participatory Sensing, On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources, On the Efficiency of All-Pay Mechanisms, Computing Stable Coalitions: Approximation Algorithms for Reward Sharing