SearcharxivSearch

arXiv · 2609.22531

Visibility Design and Strategic Reasoning

Abstract

Dashboards, feeds, and leaderboards determine whom agents believe they are playing against. We study how such information architectures shape strategic behavior, and how a designer who controls them can use visibility as a lever. We propose a behavioral model in which a transparency parameter governs how selectively agents are exposed to opponents of nearby reasoning depth, and embed it in a Cognitive Hierarchy environment, which provides a tractable language for tying agents' beliefs about the sophistication of others to what they see. We show that because the exposure operator is an exponential tilt of the type distribution, the effect of transparency on aggregate behavior has a closed form: the derivative of the aggregate action with respect to $p$ is proportional to the population-average variance of perceived sophistication. This identity signs the effect in games of strategic complements (opacity raises aggregate effort) and in coordination environments (opacity lowers the mean action), and an ordinal version holds for any response rule that is monotone in the belief. Notably, under a Poisson prior, opacity acts as a sophistication multiplier: every reasoner plays as if the population were $\mathrm{Poisson}(τ/p)$. We use this structure to characterize the disagreement-versus-level tradeoff faced by a coordination-minded designer, to identify the reasoning depths that respond most to visibility, and to show that opacity imposes a ``sophistication tax'' under which the deepest reasoners can lose to moderate ones. Simulations in which agents see only a noisy leaderboard of published actions reproduce both the reversal and the tax. Together, our findings highlight that who an agent sees, and not only how deeply it reasons, shapes strategic behavior, and point to visibility as a design lever.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raman Ebrahimi, Sepehr Ilami, Babak Heydari, Isabel Trevino, Massimo Franceschetti. 2026-09-18. Visibility Design and Strategic Reasoning. https://arxiv.org/abs/2609.22531

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

KEEP EXPLORING

Related papers

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

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

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