Sychronous vs. asynchronous coalitions in multiplayer games, with applications to guts poker

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Babyak, Jessica, Buck, Kevin, Dichter, Leah, Jiang, David, Zumbrun, Kevin
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915081818734592
author Babyak, Jessica
Buck, Kevin
Dichter, Leah
Jiang, David
Zumbrun, Kevin
author_facet Babyak, Jessica
Buck, Kevin
Dichter, Leah
Jiang, David
Zumbrun, Kevin
contents We study the issue introduced by Buck-Lee-Platnick-Wheeler-Zumbrun of synchronous vs. asynchronous coalitions in multiplayer games, that is, the difference between coalitions with full and partial communication, with a specific interest in the context of continuous Guts poker where this problem was originally formulated. We observe for general symmetric multiplayer games, with players 2-n in coalition against player 1, that there are three values, corresponding to symmetric Nash equilibrium, optimal asynchronous, and optimal synchronous strategies, in that order, for which inequalities may for different examples be strict or nonstrict (i.e., equality) in any combination. Different from Nash equilibria and synchronous optima, which may be phrased as convex optimization problems, or classical 2-player games, determination of asynchronous optima is a nonconvex optimization problem. We discuss methods of numerical approximation of this optimum, and examine performance on 3-player rock-paper-scissors and discretized Guts poker. Finally, we present sufficient conditions guaranteeing different possibilities for behavior, based on concave/convexity properties of the payoff function. These answer in the affirmative the open problem posed by Buck-Lee-Platnick-Wheeler-Zumbrun whether the optimal asynchronous coalition value for 3-player guts is equal to the Nash equilibrium value zero. At the same time, we present a number of new results regarding synchronous coalition play for continuous $3$-player guts.
format Preprint
id arxiv_https___arxiv_org_abs_2412_19855
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sychronous vs. asynchronous coalitions in multiplayer games, with applications to guts poker
Babyak, Jessica
Buck, Kevin
Dichter, Leah
Jiang, David
Zumbrun, Kevin
Computer Science and Game Theory
We study the issue introduced by Buck-Lee-Platnick-Wheeler-Zumbrun of synchronous vs. asynchronous coalitions in multiplayer games, that is, the difference between coalitions with full and partial communication, with a specific interest in the context of continuous Guts poker where this problem was originally formulated. We observe for general symmetric multiplayer games, with players 2-n in coalition against player 1, that there are three values, corresponding to symmetric Nash equilibrium, optimal asynchronous, and optimal synchronous strategies, in that order, for which inequalities may for different examples be strict or nonstrict (i.e., equality) in any combination. Different from Nash equilibria and synchronous optima, which may be phrased as convex optimization problems, or classical 2-player games, determination of asynchronous optima is a nonconvex optimization problem. We discuss methods of numerical approximation of this optimum, and examine performance on 3-player rock-paper-scissors and discretized Guts poker. Finally, we present sufficient conditions guaranteeing different possibilities for behavior, based on concave/convexity properties of the payoff function. These answer in the affirmative the open problem posed by Buck-Lee-Platnick-Wheeler-Zumbrun whether the optimal asynchronous coalition value for 3-player guts is equal to the Nash equilibrium value zero. At the same time, we present a number of new results regarding synchronous coalition play for continuous $3$-player guts.
title Sychronous vs. asynchronous coalitions in multiplayer games, with applications to guts poker
topic Computer Science and Game Theory
url https://arxiv.org/abs/2412.19855