Excludability and bounded computational capacity

Ehud Lehrer; Eilon Solan

doi:10.1287/moor.1060.0211

Excludability and bounded computational capacity

Ehud Lehrer^*, Eilon Solan

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	637-648
Number of pages	12
Journal	Mathematics of Operations Research
Volume	31
Issue number	3
DOIs	https://doi.org/10.1287/moor.1060.0211
State	Published - 2006

Keywords

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

Access to Document

10.1287/moor.1060.0211

Cite this

@article{0ea55c3ddcd84fa2aceced797240390b,

title = "Excludability and bounded computational capacity",

abstract = "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.",

keywords = "Blackwell's approachability, Bounded-recall strategies, Excludability, Finite automata, Repeated games, Vector payoffs",

author = "Ehud Lehrer and Eilon Solan",

year = "2006",

doi = "10.1287/moor.1060.0211",

language = "אנגלית",

volume = "31",

pages = "637--648",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Institute for Operations Research and the Management Sciences",

number = "3",

}

TY - JOUR

T1 - Excludability and bounded computational capacity

AU - Lehrer, Ehud

AU - Solan, Eilon

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Blackwell's approachability

KW - Bounded-recall strategies

KW - Excludability

KW - Finite automata

KW - Repeated games

KW - Vector payoffs

UR - http://www.scopus.com/inward/record.url?scp=33748438402&partnerID=8YFLogxK

U2 - 10.1287/moor.1060.0211

DO - 10.1287/moor.1060.0211

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:33748438402

SN - 0364-765X

VL - 31

SP - 637

EP - 648

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 3

ER -

Excludability and bounded computational capacity

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this