31 citations · 63 across the 39 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018
On the approximation guarantee of obviously strategyproof mechanisms
Diodato Ferraioli, Adrian Meier, Paolo Penna +1
Catering to the incentives of people with limited rationality is a challenging research direction that requires novel paradigms to design mechanisms and approximation algorithms. O…
cs.GT2018
Probabilistic Verification for Obviously Strategyproof Mechanisms
Diodato Ferraioli, Carmine Ventre
Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent…