2012
DOI: 10.1007/s00236-012-0153-3
|View full text |Cite
|
Sign up to set email alerts
|

“Backward” coinduction, Nash equilibrium and the rationality of escalation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
26
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(26 citation statements)
references
References 26 publications
0
26
0
Order By: Relevance
“…Zero sum games are the situations where one or more players' gain (loss) equals the loss (gain) of other players. Therefore, a gain (loss) for one must result in a loss (gain) for one or more others, which simply means one player gains the equal amount that its opponent losses [27,28]. On the other hand, when the final result of all players is not zero, the game is anon-zero sum game [24,29].…”
Section: Zero-sum and Non Zero-sum Gamesmentioning
confidence: 99%
“…Zero sum games are the situations where one or more players' gain (loss) equals the loss (gain) of other players. Therefore, a gain (loss) for one must result in a loss (gain) for one or more others, which simply means one player gains the equal amount that its opponent losses [27,28]. On the other hand, when the final result of all players is not zero, the game is anon-zero sum game [24,29].…”
Section: Zero-sum and Non Zero-sum Gamesmentioning
confidence: 99%
“…In 2006 Coq was used by [19], which was generalized by [13], to formalize and check a result from game theory: Kuhn's existence of a Nash equilibrium (NE) in finite games in extensive form. Coq was also used to deal with some infinite games in extensive form [15], or with random Boolean games [17]. Isabelle/HOL, another proof software, was used recently [6] to formalize and check a result in game theory for logic and computer science: the positional determinacy of parity games.…”
Section: Introduction and Motivationsmentioning
confidence: 99%
“…• The result features games in normal form, a very general class of games that includes finite and infinite games in extensive form discussed in [19], [13], [15] and [16], and Muller and parity games discussed in [10], [7], [6], and [4].…”
Section: Introduction and Motivationsmentioning
confidence: 99%
“…Other approaches use dependent types to allow types of choices to dependent on earlier values, but can still only allow more general 'dependent subgames' such as in the market entry game using encoding tricks such as dummy moves, and using large negative utilities to rule out certain plays. (Examples of game theory developed in a dependent type system include [13], [2].) An external choice operator solves the more general problem of dependent subgames in an elegant way.…”
Section: Example: Market Entry Gamementioning
confidence: 99%