Excludability and Bounded Computational Capacity

DOI10.1287/MOOR.1060.0211zbMath1276.91022OpenAlexW2099635476MaRDI QIDQ5388001

Eilon Solan, Ehud Lehrer

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

finite automatavector payoffsexcludabilityBlackwell's approachabilitybounded-recall strategies

Mathematics Subject Classification ID

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

Related Items (7)

Approachability in population games ⋮ Approachability with bounded memory ⋮ Robust mean field games ⋮ Constrained no-regret learning ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Repeated Games with Incomplete Information ⋮ A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma

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