Automated optimal OSP mechanisms for set systems. The case of small domains

DOI10.1007/978-3-030-35389-6_13zbMATH Open1435.91060OpenAlexW2990995419MaRDI QIDQ777956FDOQ777956

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

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

zbMATH Keywords

bounded rationalityextensive form mechanisms

Mathematics Subject Classification ID

Mechanism design theory (91B03)

Cites Work

• Multi-parameter mechanism design and sequential posted pricing
• Algorithmic mechanism design
• Optimal collusion-resistant mechanisms with verification
• The taxation principle and multi-time Hamilton-Jacobi equations
• Stable matching mechanisms are not obviously strategy-proof
• Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling
• Sequential Posted Price Mechanisms with Correlated Valuations
• The Performance of Deferred-Acceptance Auctions
• Automated optimal OSP mechanisms for set systems. The case of small domains

Cited In (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

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)