Automated optimal OSP mechanisms for set systems. The case of small domains
From MaRDI portal
Publication:777956
DOI10.1007/978-3-030-35389-6_13zbMath1435.91060OpenAlexW2990995419MaRDI QIDQ777956
Diodato Ferraioli, Paolo Penna, Adrian Meier, Carmine Ventre
Publication date: 30 June 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-35389-6_13
Related Items (4)
Obvious strategyproofness, bounded rationality and approximation ⋮ Two-way greedy: algorithms for imperfect rationality ⋮ 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
Cites Work
- Automated optimal OSP mechanisms for set systems. The case of small domains
- The taxation principle and multi-time Hamilton-Jacobi equations
- Stable matching mechanisms are not obviously strategy-proof
- Optimal collusion-resistant mechanisms with verification
- Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling
- Multi-parameter mechanism design and sequential posted pricing
- Sequential Posted Price Mechanisms with Correlated Valuations
- The Performance of Deferred-Acceptance Auctions
- Algorithmic mechanism design
This page was built for publication: Automated optimal OSP mechanisms for set systems. The case of small domains
