Excludability and bounded computational capacity

• 成果类型: Article
• 署名作者: Lehrer, Ehud; Solan, Eflon
• 署名单位: Tel Aviv University
• 刊物名称: MATHEMATICS OF OPERATIONS RESEARCH
• ISSN/ISSBN: 0364-765X
• DOI: 10.1287/moor.1060.0211
• 发表日期: 2006
• 页码: 637-648
• 关键词: repeated prisoners-dilemma; weak approachability; 2-person game

摘要

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.