The Value of Ambiguous Commitments in Multi-Follower Games

Natalie Collina; Rabanus Derr; Aaron Roth

Home/Archive/arXiv

arXiv · 2409.05608

The Value of Ambiguous Commitments in Multi-Follower Games

Natalie Collina·Rabanus Derr·Aaron Roth

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study games in which a leader makes a single commitment, and then multiple followers (each with a different utility function) respond. In particular, we study ambiguous commitment strategies in these games, in which the leader may commit to a set of mixed strategies, and ambiguity-averse followers respond to maximize their worst-case utility over the set of leader strategies. Special cases of this setting have previously been studied when there is a single follower: in these cases, it is known that the leader can increase her utility by making an ambiguous commitment if the follower is restricted to playing a pure strategy, but that no gain can be had from ambiguity if the follower may mix. We confirm that this result continues to hold in the setting of general Stackelberg games. We then develop a theory of ambiguous commitment in games with multiple followers. We begin by considering the case where the leader must make the same commitment against each follower. We establish that -- unlike the case of a single follower -- ambiguous commitment can improve the leader's utility by an unboundedly large factor, even when followers are permitted to respond with mixed strategies and even. We go on to show an advantage for the leader coupling the same commitment across all followers, even when she has the ability to make a separate commitment to each follower. In particular, there exist general sum games in which the leader can enjoy an unboundedly large advantage by coupling her ambiguous commitment across multiple followers rather than committing against each individually. In zero-sum games we show there can be no such coupling advantage. Finally, we give a polynomial time algorithm for computing the optimal leader commitment strategy in the special case in which the leader has 2 actions (and k followers may have m actions), and prove that in the general case, the problem is NP-hard.

Explore related subjects

cs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Natalie Collina, Rabanus Derr, Aaron Roth. 2024-09-09. The Value of Ambiguous Commitments in Multi-Follower Games. https://arxiv.org/abs/2409.05608

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT↗

arXiv2026

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT↗

arXiv2026

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT↗