Single-payoff farsighted stable sets in strategic games with dominant punishment strategies
Author(s) -
Toshiyuki Hirai
Publication year - 2017
Publication title -
international journal of game theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.461
H-Index - 44
eISSN - 1432-1270
pISSN - 0020-7276
DOI - 10.1007/s00182-017-0597-3
Subject(s) - stochastic game , mathematical economics , class (philosophy) , set (abstract data type) , repeated game , symmetric game , mathematics , computer science , game theory , normal form game , artificial intelligence , programming language
We investigate farsighted stable sets in a class of strategic games with dominant punishment strategies. In this class of games, each player has a strategy that uniformly minimizes the other players’ payoffs for any given strategies chosen by these other players. We particularly investigate a special class of farsighted stable sets, each of which consists of strategy profiles yielding a single payoff vector. We call such a farsighted stable set as a single-payoff farsighted stable set. We propose a concept called an inclusive set that completely characterizes single-payoff farsighted stable sets in strategic games with dominant punishment strategies. We also show that the set of payoff vectors yielded by single-payoff farsighted stable sets is closely related to the strict \(\alpha \)-core in a strategic game. Furthermore, we apply the results to strategic games where each player has two strategies and strategic games associated with some market models.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom