Linear Duality and Its Nonlinear Extension via Topological Covering Theorems

Linear programming duality and core existence theorems in cooperative game theory are closely related. For example, in the 1960s, Bondareva used linear duality to characterize when the core of a game with transferable utility is nonempty. Scarf later established a core existence theorem for balanced games with non-transferable utility. Shapley derived this result from his KKMS covering theorem, demonstrating how topological covering theorems yield core existence results. In this note we give a new KKM-type covering proof of linear duality. We then extend the argument to inequalities with continuous perturbations. Under some asymptotic growth assumptions on perturbations, we obtain a feasible point and balancing coefficients satisfying complementary slackness, a Lagrangian lower bound, and a Scarf-type feasibility criterion. The latter yields Scarf's theorem for normalized cooperative games with non-transferable utility. Using Musin's 2017 KKM-type theorems with boundary conditions and the author's 2026 results on cover degrees relative to point configurations, we also obtain a complementary slackness theorem for continuous functions on compact connected oriented manifolds with nonempty boundary.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24179
Primary Topic
Game Theory and Voting Systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Linear Duality and Its Nonlinear Extension via Topological Covering Theorems

Mikhail V. Bludov
arXiv (Cornell University)
Game Theory and Voting Systems
preprint

Linear Duality and Its Nonlinear Extension via Topological Covering Theorems

Mikhail V. Bludov
preprint en

Abstract

Linear programming duality and core existence theorems in cooperative game theory are closely related. For example, in the 1960s, Bondareva used linear duality to characterize when the core of a game with transferable utility is nonempty. Scarf later established a core existence theorem for balanced games with non-transferable utility. Shapley derived this result from his KKMS covering theorem, demonstrating how topological covering theorems yield core existence results. In this note we give a new KKM-type covering proof of linear duality. We then extend the argument to inequalities with continuous perturbations. Under some asymptotic growth assumptions on perturbations, we obtain a feasible point and balancing coefficients satisfying complementary slackness, a Lagrangian lower bound, and a Scarf-type feasibility criterion. The latter yields Scarf's theorem for normalized cooperative games with non-transferable utility. Using Musin's 2017 KKM-type theorems with boundary conditions and the author's 2026 results on cover degrees relative to point configurations, we also obtain a complementary slackness theorem for continuous functions on compact connected oriented manifolds with nonempty boundary.

arXiv (Cornell University)
Game Theory and Voting Systems
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