Intransitivity in Game Theory - Mathematics · 2011. 3. 7. · Intransitivity in Game Theory Jeremy...
1
Intransitivity in Game Theory Jeremy West Abstract for 17 March 2011 When ranking objects, we often expect the ranking to be transitive. That is, if A is better than B and B is better than C, then we might expect that A is better than C. Unfortunately, this is not always the case. There are many examples of intransitivity in game theory and I will present two of them in this talk: the simple dice game Knock 'em Down and the well-known example of the Nontransitive Dice. Finally, I will discuss the similarly motivated theorem of Arrow on the impossibility of a rational voting system.
Transcript of Intransitivity in Game Theory - Mathematics · 2011. 3. 7. · Intransitivity in Game Theory Jeremy...
![Page 1: Intransitivity in Game Theory - Mathematics · 2011. 3. 7. · Intransitivity in Game Theory Jeremy West Abstract for 17 March 2011 When ranking objects, we often expect the ranking](https://reader035.fdocuments.net/reader035/viewer/2022071518/613c35ad4c23507cb6353c2a/html5/thumbnails/1.jpg)
Intransitivity in Game Theory Jeremy West
Abstract for 17 March 2011
When ranking objects, we often expect the ranking to be transitive. That is, if A is better than B and B is better than C, then we might expect that A is better than C. Unfortunately, this is not always the case. There are many examples of intransitivity in game theory and I will present two of them in this talk: the simple dice game Knock 'em Down and the well-known example of the Nontransitive Dice. Finally, I will discuss the similarly motivated theorem of Arrow on the impossibility of a rational voting system.