Obvious Strategyproofness, Bounded Rationality and Approximation - The Case of Machine Scheduling

Diodato Ferraioli, Carmine Ventre. Obvious Strategyproofness, Bounded Rationality and Approximation - The Case of Machine Scheduling. In Dimitris Fotakis, Evangelos Markakis, editors, Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, Proceedings. Volume 11801 of Lecture Notes in Computer Science, pages 77-91, Springer, 2019. [doi]

Abstract

Abstract is missing.