2000 character limit reached
Knightian Robustness of Single-Parameter Domains
Published 25 Mar 2014 in cs.GT | (1403.6411v1)
Abstract: 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, $\theta*$, consists of a set of distributions, from one of which $\theta_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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.