2014/03/25 by Chiesa, Alessandro, Micali, Silvio, Zhu, Zeyuan Allen
#Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences
paper · doi:10.48550/arxiv.1403.6411
We consider players that have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player i has about the profile of true valuations, θ^*, consists of a set of distributions, from one of which θi^* has been drawn. We prove a ``robustness'' theorem for Knightian players in single-parameter domains: every mechanism that is weakly dominant-strategy truthful for classical players continues to be well-behaved for Knightian players that choose undominated strategies.