Iterated Regret Minimization: A More Realistic Solution Concept

Details Iterated Regret Minimization: A More Realistic Solution Concept Iterated Regret Minimization: A More Realistic Solution Concept

2008-10-16

arxiv.org/abs/0810.3023v1

Computer Science

Computer Science and Game Theory

Scientific paper

For some well-known games, such as the Traveler's Dilemma or the Centipede Game, traditional game-theoretic solution concepts--and most notably Nash equilibrium--predict outcomes that are not consistent with empirical observations. In this paper, we introduce a new solution concept, iterated regret minimization, which exhibits the same qualitative behavior as that observed in experiments in many games of interest, including Traveler's Dilemma, the Centipede Game, Nash bargaining, and Bertrand competition. As the name suggests, iterated regret minimization involves the iterated deletion of strategies that do not minimize regret.

Affiliated with

Also associated with

No associations

Rating

Iterated Regret Minimization: A More Realistic Solution Concept does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Iterated Regret Minimization: A More Realistic Solution Concept, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterated Regret Minimization: A More Realistic Solution Concept will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-351587