Papers
Topics
Authors
Recent
Search
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.

Citations (3)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.