Excludability and bounded computational capacity

Ehud Lehrer*, Eilon Solan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We study the notion of excludability in repeated games with vector payoffs, when one of the players is restricted to strategies with bounded computational capacity. We show that a closed set is excludable by Player 2 when Player 1 is restricted to using only bounded-recall strategies if and only if it does not contain a convex approachable set. We provide partial results when Player 1 is restricted to using strategies that can be implemented by automata.

Original languageEnglish
Pages (from-to)637-648
Number of pages12
JournalMathematics of Operations Research
Issue number3
StatePublished - 2006


  • Blackwell's approachability
  • Bounded-recall strategies
  • Excludability
  • Finite automata
  • Repeated games
  • Vector payoffs


Dive into the research topics of 'Excludability and bounded computational capacity'. Together they form a unique fingerprint.

Cite this