Sequential games and optimal strategies

DOI10.1098/rspa.2010.0471zbMath1228.91009OpenAlexW2106315319MaRDI QIDQ3104817

Paulo Oliva, Martín Hötzel Escardó

Publication date: 17 December 2011

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.753

zbMATH Keywords

Nash equilibriumbackward inductionbacktrackingbar recursionTychonoff theoremselection function

Mathematics Subject Classification ID

Games in extensive form (91A18) Higher-type and set recursion theory (03D65)

Related Items (18)

Morphisms of open games ⋮ On Spector's bar recursion ⋮ The equivalence of bar recursion and open recursion ⋮ Higher-order games with dependent types ⋮ The Peirce translation ⋮ A note on the finitization of Abelian and Tauberian theorems ⋮ Algorithm design with the selection monad ⋮ Smart Choices and the Selection Monad ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Well Quasi-orders and the Functional Interpretation ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ A constructive interpretation of Ramsey's theorem via the product of selection functions ⋮ THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT ⋮ A generalization of Nash's theorem with higher-order functionals ⋮ BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS

Cites Work

• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Selection functions, bar recursion and backward induction
• Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
• On the computational content of the axiom of choice
• A semantics of evidence for classical arithmetic
• Modified bar recursion

This page was built for publication: Sequential games and optimal strategies