Published June 25, 2023
| Version v1
Conference paper
2 × 2 Zero-Sum Games with Commitments and Noisy Observations
Creators
Contributors
Others:
- School of Computer Engineering and Science [Shanghai] ; University of Shanghai [Shanghai]
- Network Engineering and Operations (NEO ) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- Department of Electrical and Computer Engineering [Princeton] (ECE) ; Princeton University
- Laboratoire de Géométrie Algébrique et Applications à la Théorie de l'Information (GAATI) ; Université de la Polynésie Française (UPF)
- This work was funded by INRIA through the Exploratory Action -- Information and Decision Making (IDEM)
Description
In this paper, 2 × 2 zero-sum games are studied under the following assumptions: (1) One of the players (the leader) commits to choose its actions by sampling a given probability measure (strategy); (2) The leader announces its action, which is observed by its opponent (the follower) through a binary channel; and (3) the follower chooses its strategy based on the knowledge of the leader's strategy and the noisy observation of the leader's action. Under these conditions, the equilibrium is shown to always exist. Interestingly, even subject to noise, observing the actions of the leader is shown to be either beneficial or immaterial for the follower. More specifically, the payoff at the equilibrium of this game is upper bounded by the payoff at the Stackelberg equilibrium (SE) in pure strategies; and lower bounded by the payoff at the Nash equilibrium, which is equivalent to the SE in mixed strategies. Finally, necessary and sufficient conditions for observing the payoff at equilibrium to be equal to its lower bound are presented. Sufficient conditions for the payoff at equilibrium to be equal to its upper bound are also presented.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://inria.hal.science/hal-04091712
- URN
- urn:oai:HAL:hal-04091712v2