On black-box transformations in downward-closed environments
From MaRDI portal
Publication:2322707
DOI10.1007/s00224-018-9898-6zbMath1422.91141arXiv1707.00230OpenAlexW3099823252WikidataQ128890387 ScholiaQ128890387MaRDI QIDQ2322707
Publication date: 5 September 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.00230
Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Welfare economics (91B15)
Cites Work
- Unnamed Item
- Bayesian incentive compatibility via matchings
- Bayesian algorithmic mechanism design
- On the Impossibility of Black-Box Transformations in Mechanism Design
- Black-Box Reductions in Mechanism Design
- Single-Parameter Combinatorial Auctions with Partially Public Valuations
- Approximation Techniques for Utilitarian Mechanism Design
- Single-value combinatorial auctions and algorithmic implementation in undominated strategies
- Optimal Auction Design
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- On the limits of black-box reductions in mechanism design
- Black-Box Randomized Reductions in Algorithmic Mechanism Design
- Algorithmic mechanism design
This page was built for publication: On black-box transformations in downward-closed environments