Timeline for Is there an equilibrium for this non-zero-sum game?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2021 at 9:48 | vote | accept | Eric | ||
| Jul 24, 2021 at 13:55 | history | edited | Eilon | CC BY-SA 4.0 |
deleted 89 characters in body
|
| Jul 23, 2021 at 6:46 | comment | added | Eric | That's different with what I had in mind though. In my setup of the game players have no memories and their choices of bet depend only on the current number of chips. I've edited the question to give a formal definition of what I mean by a player's strategy. Does the theorems still hold in this case? | |
| Jul 23, 2021 at 6:10 | comment | added | Eilon | Eric, in stochastic games, a strategy is a function from finite histories (the sequence of past states and past choices of the players) to lotteries over actions. There was a typo in my original answer: by Thuijsman and Raghavan (1997), the equilibrium strategies of the players are deterministic and depend on the current state as well as on the history of the play. | |
| Jul 23, 2021 at 6:07 | history | edited | Eilon | CC BY-SA 4.0 |
deleted 38 characters in body
|
| Jul 22, 2021 at 5:46 | comment | added | Eric | I don't quite follow the 2nd paragraph. Are you defining a player's strategy as a function of the current number of chips in the pot as well as the history of how others have played? | |
| Jul 22, 2021 at 4:59 | history | answered | Eilon | CC BY-SA 4.0 |