mlsanityData to 14 Oct 2026

2 × 2 Zero-Sum Games with Commitments and Noisy Observations

arXiv 2211.01703 ↗First posted 3 Nov 2022cs.GT cs.IT cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 27 references that are in the map. First posted on arXiv 3 Nov 2022.

Builds on

3 of 27 references.

References · 3

  1. 2021Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Gamescited by 40
  2. 2017On Stackelberg Mixed Strategiescited by 10
  3. 2016On the commitment value and commitment optimal strategies in bimatrix gamescited by 2

Built on by

Not cited yet.