Notions of Anonymity, Fairness and Symmetry for Finite Strategic-Form Games

Ham, Nicholas

doi:10.48550/arxiv.1311.4766

Cited by 1 publication

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This setting is commonly referred to as process symmetry [12,15,18,19,1]. Symmetry in games was studied in [24,23,7,17] for strategic form games, which are games with a single turn. In [5,26], symmetry in concurrent games was studied by imposing restrictions on the game structure.…”

Section: Process Symmetry In Concurrent Gamesmentioning

confidence: 99%

Concurrent Games with Multiple Topologies

Almagor¹,

Guendelman²

2022

Preprint

View full text Add to dashboard Cite

Concurrent multi-player games with ω-regular objectives are a standard model for systems that consist of several interacting components, each with its own objective. The standard solution concept for such games is Nash Equilibrium, which is a "stable" strategy profile for the players.In many settings, the system is not fully observable by the interacting components, e.g., due to internal variables. Then, the interaction is modelled by a partial information game. Unfortunately, the problem of whether a partial information game has an NE is not known to be decidable. A particular setting of partial information arises naturally when processes are assigned IDs by the system, but these IDs are not known to the processes. Then, the processes have full information about the state of the system, but are uncertain of the effect of their actions on the transitions.We generalize the setting above and introduce Multi-Topology Games (MTGs) -concurrent games with several possible topologies, where the players do not know which topology is actually used. We show that extending the concept of NE to these games can take several forms. To this end, we propose two notions of NE: Conservative NE, in which a player deviates if she can strictly add topologies to her winning set, and Greedy NE, where she deviates if she can win in a previouslylosing topology. We study the properties of these NE, and show that the problem of whether a game admits them is decidable.

show abstract

Section: Process Symmetry In Concurrent Gamesmentioning

confidence: 99%