Automated optimal OSP mechanisms for set systems. The case of small domains
From MaRDI portal
(Redirected from Publication:777956)
Recommendations
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- Obvious strategyproofness, bounded rationality and approximation
- Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling
- Algorithmic mechanism design (extended abstract)
- Optimal combinatorial mechanism design
Cites work
- Algorithmic mechanism design
- Automated optimal OSP mechanisms for set systems. The case of small domains
- Multi-parameter mechanism design and sequential posted pricing
- Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling
- Optimal collusion-resistant mechanisms with verification
- Sequential posted price mechanisms with correlated valuations
- Stable matching mechanisms are not obviously strategy-proof
- The performance of deferred-acceptance auctions
- The taxation principle and multi-time Hamilton-Jacobi equations
Cited in
(6)- Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling
- Obvious strategyproofness, bounded rationality and approximation
- Two-way greedy: algorithms for imperfect rationality
- New Constructions of Obviously Strategyproof Mechanisms
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- Automated optimal OSP mechanisms for set systems. The case of small domains
This page was built for publication: Automated optimal OSP mechanisms for set systems. The case of small domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777956)
