Elimination of dominated strategies and inessential players
Journal Title: Operations Research and Decisions - Year 2015, Vol 25, Issue 1
Abstract
We study the process, called the IEDI process, of iterated elimination of (strictly) dominated strategies and inessential players for finite strategic games. Such elimination may reduce the size of a game considerably, for example, from a game with a large number of players to one with a few players. We extend two existing results to our context; the preservation of Nash equilibria and orderindependence. These give a way of computing the set of Nash equilibria for an initial situation from the endgame. Then, we reverse our perspective to ask the question of what initial situations end up at a given final game. We assess what situations underlie an endgame. We give conditions for the pattern of player sets required for a resulting sequence of the IEDI process to an endgame. We illustrate our development with a few extensions of the battle of the sexes.
Authors and Affiliations
Mamoru KANEKO, Shuige LIU
Keywords
Related Articles
- EP ID EP323585
- DOI -
- Views 38
- Downloads 0
Factors affecting the result of matches in the one day format of cricket
Factors contributing to winning games are imperative, as the ultimate objective in a game is vic-tory. The aim of this study was to identify the factors that characterize the game of cricket, and to investigate the facto...
Further open problems in cooperative games
In 2013, the International Game Theory Review published two special issues on open problems in cooperative games: the first regarding theory and the second applications. In this paper, our aim is to present some problems...
A Bayesian model of group decision-making
A change in the opinion of a group, treated as a network of communicating agents, caused by the accumulation of new information is expected to depend on communication within the group, coopera-tion and, possibly, a kind...
On types of responsiveness in the theory of voting
In mathematics, monotonicity is used to denote the nature of the connection between variables. Hence for example, a variable is said to be a monotonically increasing function of another variable if an increase in the val...
Solving linear fractional multilevel programs
The linear fractional multilevel programming (LFMP) problem has been studied and it has been proved that an optimal solution to this problem occurs at a boundary feasible extreme point. Hence the Kth-best algorithm can b...