Black-box randomized reductions in algorithmic mechanism design
From MaRDI portal
(Redirected from Publication:5419042)
Black-box randomized reductions in algorithmic mechanism design (scientific article; zbMATH DE number 6300928)
Black-box randomized reductions in algorithmic mechanism design (scientific article; zbMATH DE number 6300928)
Recommendations
- Black-box reductions in mechanism design
- On the limits of black-box reductions in mechanism design
- Black-box reductions for cost-sharing mechanism design
- On the power of randomization in algorithmic mechanism design
- Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations
Cited in
(17)- A universally-truthful approximation scheme for multi-unit auctions
- Black-box reductions for cost-sharing mechanism design
- Network pollution games
- On black-box transformations in downward-closed environments
- Bayesian incentive compatibility via matchings
- New results for network pollution games
- On the impossibility of black-box transformations in mechanism design
- Black-box reductions in mechanism design
- Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem
- Algorithmic Mechanism Design for Collaboration in Large-Scale Transportation Networks
- Algorithms as mechanisms: the price of anarchy of relax and round
- Bernoulli Factories and Black-box Reductions in Mechanism Design
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- On the limits of black-box reductions in mechanism design
- scientific article; zbMATH DE number 7053320 (Why is no real title available?)
- Black-box reductions for cost-sharing mechanism design
- Reducing mechanism design to algorithm design via machine learning
This page was built for publication: Black-box randomized reductions in algorithmic mechanism design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419042)
