Imitation in Large Games
In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation types: that of players who imitate choice of other (optimizing)...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1006.2992v1 |
id |
doaj-b7dd589b4af742fd9dba2b08b11b6edf |
---|---|
record_format |
Article |
spelling |
doaj-b7dd589b4af742fd9dba2b08b11b6edf2020-11-24T22:25:52ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802010-06-0125Proc. GANDALF 201016217210.4204/EPTCS.25.16Imitation in Large GamesSoumya PaulR. RamanujamIn games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation types: that of players who imitate choice of other (optimizing) types. Game theorists typically study the evolution of such games in dynamical systems with imitation rules. In the setting of games of infinite duration on finite graphs with preference orderings on outcomes for player types, we explore the possibility of imitation as a viable strategy. In our setup, the optimising players play bounded memory strategies and the imitators play according to specifications given by automata. We present algorithmic results on the eventual survival of types. http://arxiv.org/pdf/1006.2992v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Soumya Paul R. Ramanujam |
spellingShingle |
Soumya Paul R. Ramanujam Imitation in Large Games Electronic Proceedings in Theoretical Computer Science |
author_facet |
Soumya Paul R. Ramanujam |
author_sort |
Soumya Paul |
title |
Imitation in Large Games |
title_short |
Imitation in Large Games |
title_full |
Imitation in Large Games |
title_fullStr |
Imitation in Large Games |
title_full_unstemmed |
Imitation in Large Games |
title_sort |
imitation in large games |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2010-06-01 |
description |
In games with a large number of players where players may have overlapping objectives, the analysis of stable outcomes typically depends on player types. A special case is when a large part of the player population consists of imitation types: that of players who imitate choice of other (optimizing) types. Game theorists typically study the evolution of such games in dynamical systems with imitation rules. In the setting of games of infinite duration on finite graphs with preference orderings on outcomes for player types, we explore the possibility of imitation as a viable strategy. In our setup, the optimising players play bounded memory strategies and the imitators play according to specifications given by automata. We present algorithmic results on the eventual survival of types. |
url |
http://arxiv.org/pdf/1006.2992v1 |
work_keys_str_mv |
AT soumyapaul imitationinlargegames AT rramanujam imitationinlargegames |
_version_ |
1725755880547287040 |