Cooperation, Repetition, and Automata

Abraham Neyman

Cooperation, Repetition, and Automata

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This chapter studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it.

Original language	English
Title of host publication	Cooperation: Game-Theoretic Approaches
Editors	Sergiu Hart, Andreu Mas-Colell
Place of Publication	Berlin, Heidelberg
Publisher	Springer Berlin Heidelberg
Pages	233-255
Number of pages	23
ISBN (Print)	978-3-642-60454-6
State	Published - 1997

Publication series

Name	NATO ASI series. Series F, Computer and systems sciences
Publisher	springer
Volume	155

Cite this

@inproceedings{c269c7cb149d4ae5a6cba8e8aa26ef1d,

title = "Cooperation, Repetition, and Automata",

abstract = "This chapter studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it.",

author = "Abraham Neyman",

year = "1997",

language = "אנגלית",

isbn = "978-3-642-60454-6",

series = "NATO ASI series. Series F, Computer and systems sciences",

publisher = "Springer Berlin Heidelberg",

pages = "233--255",

editor = "Sergiu Hart and Andreu Mas-Colell",

booktitle = "Cooperation: Game-Theoretic Approaches",

}

Cooperation, Repetition, and Automata. / Neyman, Abraham.
Cooperation: Game-Theoretic Approaches. ed. / Sergiu Hart; Andreu Mas-Colell. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. p. 233-255 (NATO ASI series. Series F, Computer and systems sciences; Vol. 155).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Cooperation, Repetition, and Automata

AU - Neyman, Abraham

PY - 1997

Y1 - 1997

N2 - This chapter studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it.

AB - This chapter studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it.

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

SN - 978-3-642-60454-6

T3 - NATO ASI series. Series F, Computer and systems sciences

SP - 233

EP - 255

BT - Cooperation: Game-Theoretic Approaches

A2 - Hart, Sergiu

A2 - Mas-Colell, Andreu

PB - Springer Berlin Heidelberg

CY - Berlin, Heidelberg

ER -

Cooperation, Repetition, and Automata

Abstract

Publication series

Fingerprint

Cite this