Destroy to save
From MaRDI portal
Publication:2016245
Recommendations
Cites work
- Algorithmic Game Theory
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Better redistribution with inefficient allocation in multi-unit auctions
- Destroy to save
- Fair imposition
- scientific article; zbMATH DE number 3650233 (Why is no real title available?)
- Online mechanisms
- Optimal-in-expectation redistribution mechanisms
- Redistribution mechanisms for assignment of heterogeneous objects
- Worst-case optimal redistribution of VCG payments in multi-unit auctions
Cited in
(15)- A subsidized Vickrey auction for cost sharing
- Destroy to save
- Optimal budget-balanced ranking mechanisms to assign identical objects
- To transfer or to destroy
- A Solomonic solution to the problem of assigning a private indivisible good
- Constrained-optimal strategy-proof assignment: beyond the Groves mechanisms
- Efficient money burning in general domains
- Better redistribution with inefficient allocation in multi-unit auctions
- Maximizing social welfare in congestion games via redistribution
- Efficient money burning in general domains
- SAVE: Robust or not?
- Optimal allocation of an indivisible good
- Withholding and damage in Bayesian trade mechanisms
- Optimal private good allocation: the case for a balanced budget
- Optimal-in-expectation redistribution mechanisms
This page was built for publication: Destroy to save
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016245)