On the Computational Complexity of Optimal Simple Mechanisms
From MaRDI portal
Publication:2800549
DOI10.1145/2840728.2840736zbMath1334.68104arXiv1511.04741OpenAlexW2268535217MaRDI QIDQ2800549
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.04741
Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders ⋮ Explicitly simple near-tie auctions
This page was built for publication: On the Computational Complexity of Optimal Simple Mechanisms
