A Common Exponential Lower Bound for Dantzig and Modified Simplex in Deterministic Discounted Games

On a family of $N$-state deterministic two-player discounted games, every run that chooses adaptively between Dantzig's rule and modified simplex requires $2^{Ω(N)}$ switches from a specified initial strategy, regardless of tie breaking. More generally, a return-gate construction lets Dantzig reproduce any finite Bland prefix in an undiscounted deterministic Markov decision process with rational rewards whenever every visited policy reaches a common sink from all states. Applied to an acyclic binary counter, deleting the minimizer's return actions preserves every fixed maximizing strategy's value at each original state while reducing Dantzig's switch count from exponential to linear. With returns, halving the total optimality gap can take $Ω(h/\log h)$ switches at discount horizon $h=(1-γ)^{-1}$, even on games solvable in linear arithmetic time. Conversely, Dantzig is strongly polynomial when strongly connected components have bounded size, each state has a bounded number of actions, and the condensation graph has height $O(\log N)$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22977
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Common Exponential Lower Bound for Dantzig and Modified Simplex in Deterministic Discounted Games

Xinyu Qiao, Tao Yao
arXiv (Cornell University)
Complexity and Algorithms in Graphs
preprint

A Common Exponential Lower Bound for Dantzig and Modified Simplex in Deterministic Discounted Games

Xinyu Qiao, Tao Yao
preprint en

Abstract

On a family of $N$-state deterministic two-player discounted games, every run that chooses adaptively between Dantzig's rule and modified simplex requires $2^{Ω(N)}$ switches from a specified initial strategy, regardless of tie breaking. More generally, a return-gate construction lets Dantzig reproduce any finite Bland prefix in an undiscounted deterministic Markov decision process with rational rewards whenever every visited policy reaches a common sink from all states. Applied to an acyclic binary counter, deleting the minimizer's return actions preserves every fixed maximizing strategy's value at each original state while reducing Dantzig's switch count from exponential to linear. With returns, halving the total optimality gap can take $Ω(h/\log h)$ switches at discount horizon $h=(1-γ)^{-1}$, even on games solvable in linear arithmetic time. Conversely, Dantzig is strongly polynomial when strongly connected components have bounded size, each state has a bounded number of actions, and the condensation graph has height $O(\log N)$.

arXiv (Cornell University)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon