Showing 1 - 10 of 93
Kohlberg and Mertens argued that a solution concept to a game should be invariant under the addition of deletion of an equivalent strategy and not require the use of weakly dominated strategies. In this paper we study which of these requirements are satisfied by Kalai and Samet's concepts of...
Persistent link: https://www.econbiz.de/10005401322
In this paper it is shown how to compute stable sets, defined by Mertens (1989), inthe context of bimatrix games only using linear optimization techniques.
Persistent link: https://www.econbiz.de/10005304953
For two person games, stable sets in the sense of Kohlberg and Mertens and quasi-stable sets in the sense of Hillas are finite. In this paper we present an example to show that these sets are not necessarily finite in games with more than two players.
Persistent link: https://www.econbiz.de/10005371490
By a player splitting we mean a mechanism that distributes the information sets of a player among so-called agents. A player splitting is called independent if each path in the game tree contains at most one agent of every player. Following Mertens (1989), a solution is said to have the player...
Persistent link: https://www.econbiz.de/10005375578
Persistent link: https://www.econbiz.de/10005338076
Hillas (1990) introduced a definition of strategic stability based on perturbations of the best reply correspondence that satisfies all of the requirements given by Kohlberg and Mertens (1986). Hillas et al. (2001) point out though that the proofs of the iterated dominance and forward induction...
Persistent link: https://www.econbiz.de/10005155664
The goal of this paper is twofold. Firstly a short proof of the unicity of the reduced form of a normal form game is provided, using a technique to reduce a game originally introduced by Mertens. Secondly a direct combinatorial-geometric interpretation of the reduced form is described. This...
Persistent link: https://www.econbiz.de/10005795863
For two person games, stable sets in the sense of Kohlberg and Mertens and quasi-stable sets in the sense of Hillas are finite. In this paper we present an example to show that these sets are not necessarily finite in games with more than two players.
Persistent link: https://www.econbiz.de/10005062376
In this paper a procedure is described that computes for a given bimatrix game all stable sets in the sense of Kohlberg and Mertens (1986). Further the procedure is refined to find the strictly perfect equilibria (if any) of such a game.
Persistent link: https://www.econbiz.de/10005753183
Persistent link: https://www.econbiz.de/10005276090