Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting

DOI10.1017/S0960129515000365zbMath1364.91026arXiv1210.4537WikidataQ57006399 ScholiaQ57006399MaRDI QIDQ5269005

Samson Abramsky, Viktor Winschel

Publication date: 14 June 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.4537

Mathematics Subject Classification ID

Games in extensive form (91A18) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (8)

Coinductive predicates and final sequences in a fibration ⋮ Multigames and strategies, coalgebraically ⋮ The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms ⋮ A compositional treatment of iterated open games ⋮ Whither semantics? ⋮ Long-term values in Markov decision processes, (co)algebraically ⋮ Coinductive predicates and final sequences in a fibration ⋮ From Lawvere to Brandenburger-Keisler: interactive forms of diagonalization and self-reference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``Backward coinduction, Nash equilibrium and the rationality of escalation
• Subgame-perfect equilibria of finite- and infinite-horizon games
• Coalgebraic logic
• Universal coalgebra: A theory of systems
• A fixpoint theorem for complete categories
• A lattice-theoretical fixpoint theorem and its applications
• Categories of Coalgebraic Games
• Conway games, algebraically and coalgebraically
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• Applications of Metric Coinduction

This page was built for publication: Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting