Search arXivSearch

arXiv · 2607.02765

Epistemic Horizon Minority Games: When Abundance Reduces Strategic Value

Abstract

Strategic value can fall when an option becomes visible. A route, signal, bet, or opportunity may be attractive because few agents see it; public attention can erase the advantage it reveals. We formalize this mechanism as an epistemic-horizon minority game (EHMG), where agents have bounded observation horizons, action-specific awareness, desire-biased utilities, and payoffs that decline with crowding, and where the object is not a fixed congestion game with omitted actions but an awareness-transition game on a finite lattice. We prove fixed-awareness potential-game reduction, finite monotone awareness convergence, logit mean-field uniqueness under an explicit norm condition, non-reducibility from static count-based congestion games, and sensitivity bounds for nonlinear revelation. We separate the target price of information from aggregate welfare loss, showing that they can coincide, diverge, or recommend opposite disclosure policies, while modeling private revelation, public common revelation, and correlated group disclosure as distinct signal structures with different equilibrium effects. Experiments regenerate awareness sweeps, public visibility shocks, horizon-desire grids, information-constrained Braess examples, disclosure optimization, minimum harmful revelation, and counterfactual baselines isolating the epistemic mechanism from ordinary full-awareness congestion. Strategic trace encodings are evaluated as a controlled regime-recognition benchmark using raw trajectories, Fourier summaries, recurrence and Gramian images, image bundles, local-filter features, leakage probes, phase-scrambled controls, resolution and recurrence-threshold sweeps, spectral carriers, and IAAFT-matched null parameter-shift controls to test whether trace encodings recover strategic structure under robust nulls.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Faruk Alpay, Levent Sarioglu. 2026-07-02. Epistemic Horizon Minority Games: When Abundance Reduces Strategic Value. https://arxiv.org/abs/2607.02765

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