Computer Science – Computer Science and Game Theory
Scientific paper
2009-08-17
Computer Science
Computer Science and Game Theory
Scientific paper
We characterize epistemic consequences of truthful communication among rational agents in a game-theoretic setting. To this end we introduce normal-form games equipped with an interaction structure, which specifies which groups of players can communicate their preferences with each other. We then focus on a specific form of interaction, namely a distributed form of iterated elimination of strictly dominated strategies (IESDS), driven by communication among the agents. We study the outcome of IESDS after some (possibly all) messages about players' preferences have been sent. The main result of the paper provides an epistemic justification of this form of IESDS.
Apt Krzysztof R.
Witzel Andreas
Zvesper Jonathan A.
No associations
LandOfFree
Distributed iterated elimination of strictly dominated strategies 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 Distributed iterated elimination of strictly dominated strategies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed iterated elimination of strictly dominated strategies will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-19900