On the competition complexity of dynamic mechanism design

MaRDI QIDQ4608022zbMATH OpenFDO

Authors Si-Qi Liu, Christos-Alexandros Psomas

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1709.07955, http://dl.acm.org/citation.cfm?id=3175436

zbMATH Keywords

dynamic mechanism designauctioncompetition complexity

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other game-theoretic models (91A40)

Recommendations

• Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items
• Robust auctions for revenue via enhanced competition
• Optimal competitive auctions

Cited in

(8)

• On the hardness of dominant strategy mechanism design
• Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items
• On the Futility of Dynamics in Robust Mechanism Design
• A Duality-Based Unified Approach to Bayesian Mechanism Design
• Risk-robust mechanism design for a prospect-theoretic buyer
• Selling to multiple no-regret buyers
• On symmetries in multi-dimensional mechanism design
• Persuasion and incentives through the lens of duality

This page was built for publication: On the competition complexity of dynamic mechanism design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608022)