Bayesian incentive compatibility via fractional assignments
From MaRDI portal
Publication:5365076
Recommendations
Cited in
(25)- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- On black-box transformations in downward-closed environments
- Combinatorial Walrasian equilibrium
- An algorithmic characterization of multi-dimensional mechanisms
- Black-box reductions for cost-sharing mechanism design
- Ordinal Bayesian incentive compatibility in restricted domains
- Bayesian algorithmic mechanism design
- Black-box reductions in mechanism design
- A simple and approximately optimal mechanism for a buyer with complements
- Bayesian incentive compatible mechanisms
- A Duality-Based Unified Approach to Bayesian Mechanism Design
- Welfare-preserving \(\varepsilon \)-BIC to BIC transformation with negligible revenue loss
- On Bayesian Implementable Allocations
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- Black-box reductions for cost-sharing mechanism design
- A truthful mechanism for value-based scheduling in cloud computing
- A heuristic optimization of Bayesian incentive-compatible cake-cutting
- Bayesian incentive compatible parametrization of mechanisms
- Bayesian incentive compatibility via matchings
- Bayesian incentive compatibility via matchings
- Bernoulli factories and black-box reductions in mechanism design
- Worst-case mechanism design via Bayesian analysis
- Near-optimal and robust mechanism design for covering problems with correlated players
- Online pricing for multi-type of items
- Truthful mechanisms with implicit payment computation
This page was built for publication: Bayesian incentive compatibility via fractional assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365076)
