Excludability and Bounded Computational Capacity

DOI10.1287/MOOR.1060.0211MaRDI QIDQ5388001zbMATH OpenOpenAlexFDO

Authors Ehud Lehrer, Eilon Solan

Publication date 27 May 2008

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.1060.0211

zbMATH Keywords

Blackwell's approachabilitybounded-recall strategiesexcludabilityfinite automatavector payoffs

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Recommendations

• Bounded computational capacity equilibrium
• Bounded computational capacity equilibrium in repeated two-player zero-sum games
• Approachability with bounded memory
• Two-person repeated games with finite automata
• Non-computable strategies and discounted repeated games

Cited in

(7)

• Constrained no-regret learning
• Approachability with bounded memory
• Approachability, regret and calibration: implications and equivalences
• Robust mean field games
• A robust saturated strategy for \(n\)-player prisoner's dilemma
• Repeated games with incomplete information
• Approachability in population games

This page was built for publication: Excludability and Bounded Computational Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388001)