Black-Box Reductions in Mechanism Design
From MaRDI portal
Publication:3088099
DOI10.1007/978-3-642-22935-0_22zbMath1343.91019OpenAlexW53387826MaRDI QIDQ3088099
No author found.
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_22
Related Items (3)
Black-box reductions for cost-sharing mechanism design ⋮ On black-box transformations in downward-closed environments ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bayesian incentive compatibility via matchings
- Algorithmic mechanism design (extended abstract)
- Pseudorandom Generators for Polynomial Threshold Functions
- Bayesian algorithmic mechanism design
- Single-Parameter Combinatorial Auctions with Partially Public Valuations
- A PCP characterization of NP with optimal amortized query complexity
- Approximation techniques for utilitarian mechanism design
- Single-value combinatorial auctions and implementation in undominated strategies
- More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP
- Optimal Auction Design
- Incentives in Teams
- Simple analysis of graph tests for linearity and PCP
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Black-Box Randomized Reductions in Algorithmic Mechanism Design
- From convex optimization to randomized mechanisms
This page was built for publication: Black-Box Reductions in Mechanism Design
