Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0709.1263

Enumerating the Nash equilibria of rank 1-games

Thorsten Theobald
View original source ↗Read source document ↗Export metadata ↓

Abstract

A bimatrix game $(A,B)$ is called a game of rank $k$ if the rank of the matrix $A+B$ is at most $k$. We consider the problem of enumerating the Nash equilibria in (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 not all equilibria can be reached by a Lemke-Howson path and present a parametric simplex-type algorithm for enumerating all Nash equilibria of a non-degenerate game of rank 1.

Explore related subjects

cs.GTmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thorsten Theobald. 2007-09-09. Enumerating the Nash equilibria of rank 1-games. https://arxiv.org/abs/0709.1263

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

KEEP EXPLORING

Related papers

arXiv2026

Stackelberg POMDP: Learning to Lead via Reinforcement Learning

Many real-world domains--including e-commerce platform design, security planning, and multi-agent coordination--feature leader-follower problems where one decision-maker commits to a policy and others react strategically. We develop a reinforcement learning framework for such interactions in sequential environments with partial observations and multiple followers. Followers may adapt through no-regret learning or reinforcement learning, potentially departing from equilibrium behavior. The framework embeds follower adaptation into the leader's environment to construct a single-agent partially observable Markov decision process--the Stackelberg POMDP. For policy-interactive response algorithms, which access the leader's policy through queries, we prove that an optimal policy based only on the leader's game history yields an optimal commitment under the specified response procedure. We use proximal policy optimization with a centralized critic and train contextual meta-followers to respond across leader policies. In indirect mechanism design, mechanisms using buyer messages achieve higher social welfare than optimal standard sequential price mechanisms across all tested type counts, with responses certified as approximate Bayesian coarse correlated equilibria. In platform design, learned display rules increase mean consumer surplus by 8.4% over an optimized fixed price cap while accommodating hidden seller costs. In Atari bilateral trade, meta-learned follower responses support joint learning of visual gameplay and economic decisions; assigning leadership to the seller or buyer shifts transaction prices and payoffs in that agent's favor. Controlled ablations examine how response credit, policy consistency, and reward timing affect learning.

cs.GT↗
arXiv2026

Price Competition Under Platform-Mediated Search: A Consider-Then-Choose Framework

We study the problem of predicting price equilibria on e-commerce platforms where sellers compete across multiple attributes (e.g., price, average rating, delivery speed). In these settings, a platform's design choices --- such as its display ranking, filtering tools, and promotional badges --- critically shape customer search and purchase behavior, which in turn determine sellers' equilibrium pricing strategies. Our goal is to develop a tractable framework that allows a platform to anticipate the market impact of its design interventions. We consider a behavioral model --- Consider-then-Choose with Lexicographic Choice (CLC) --- specifically tailored to platform-mediated search. We establish that any local Nash equilibrium admits a sequential-move characterization; this yields a tractable procedure for computation under an interpretable sufficient condition, which we term gradient dominance. We further prove that under gradient dominance, simple, decentralized gradient-based algorithms converge to an equilibrium, providing platforms with a method for simulating market outcomes. Finally, we use our framework to study how platform design affects market outcomes. Our framework applies to any platform in which sellers compete on multiple attributes and customer choice is guided by the platform's interface. In these environments, sellers' pricing strategies must be understood not in isolation, but as a response to the platform's design. Our work provides platform operators with a rigorous toolbox to efficiently evaluate how changes to interface design, information disclosure, and ranking policies can affect competitive outcomes.

cs.GT↗
arXiv2026

From Reconnaissance to Response: Quantitative Risk Parameterization and Game Theoretic Containment in Modern Enterprise Attack

Modern Security Operations Centers struggle with delayed manual incident response, enabling adversaries to advance through the Cyber Kill Chain during early stage reconnaissance. While classical game theoretic defense models optimize strategic resource allocation, they rely on static utility matrices that fail to adapt to dynamic telemetry. This paper presents an integrated, metrics driven decision engine that bridges quantitative risk parameterization and continuous automated response time. Common Vulnerability Scoring Systems exploitability parameters are mapped to attacker success probabilities and evaluate defender log distributions via Factor Analysis of Information Risk Monte Carlo simulations. Real time SIEM logs streams are modeled as Poisson process arrival rates, dynamically updating defender posterior threat belief through sequential Bayesian filtering. A closed form threshold is derived by framing the interaction as a dynamic Bayesian Stackelberg game, where the expected unmitigated risk exceeds proactive containment cost. Parameterized against empirical data from the 2023 MGM Resorts and Caesars Entertainment cyber incident, simulation results demonstrate that the engine suppresses transient background noise while triggering automated SOAR network isolation within seconds of adversarial probing. Multi parameter sensitivity analysis confirms that the decision boundary dynamically adjusts to live perimeter vulnerability, offering a control theoretic foundation for sub minute automated threat containment.

cs.GT↗