Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling

DOI10.1007/978-3-030-30473-7_6zbMath1431.91090OpenAlexW3136595833MaRDI QIDQ2292616

Carmine Ventre, Diodato Ferraioli

Publication date: 4 February 2020

Full work available at URL: https://rd.springer.com/content/pdf/10.1007%2F978-3-030-30473-7_6.pdf

zbMATH Keywords

machine schedulingbounded rationalitymechanism designlookaheadsimple mechanisms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Algorithmic game theory and complexity (91A68) Mechanism design theory (91B03)

Related Items (4)

Obvious strategyproofness, bounded rationality and approximation ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Obviously Strategyproof Mechanisms for Machine Scheduling. ⋮ Automated optimal OSP mechanisms for set systems. The case of small domains

This page was built for publication: Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling