MbrlCatalogueTitleDetail

Do you wish to reserve the book?
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment
Hey, we have placed the reservation for you!
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Title added to your shelf!
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment

Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
How would you like to get it?
We have requested the book for you! Sorry the robot delivery is not available at the moment
We have requested the book for you!
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment
Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment
Journal Article

Strategy-Proof Mechanism Design with Boundedly Rational Agents: Theory and Experiment

2026
Request Book From Autostore and Choose the Collection Method
Overview
In a strategy-proof mechanism, implementation theory mostly assumes that each agent is rational in the sense that the agent reveals its true preference to induce its most preferred outcome. This assumption is sufficient to guarantee that the agent seeks such an outcome, but not necessary because the agent might be able to induce the outcome by revealing its other preference. On the basis of such an understanding, this paper considers an implementation problem with the bounded rationality of agents. The bounded rationality presented in this paper means that the agent might choose its best response which is different from its dominant strategy. To describe such behavior, this paper introduces a new notion of equilibrium, called (n−k)-dominant strategy Nash equilibrium at which at most k∈0,1,…,n boundedly rational agents might choose their best responses which are different from their dominant strategies, and at least (n−k) rational agents choose their dominant strategies. In addition, to show what a socially optimal outcome is collectively chosen under the existence of boundedly rational agents, this paper introduces a new notion of implementation, called k-secure implementation, which is a double implementation in dominant strategy equilibria and (n−k)-dominant strategy Nash equilibria. In specific environments with k≤(n+1)/2, this paper shows that majority rule satisfies k-secure implementability, but not secure implementability which is equivalent to n-secure implementability. In addition, this paper shows that majority rule realized the socially optimal outcome in the environments in laboratory experiments.