Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.04279

Computing Equilibria in Integer Programming Games with Shared Constraints

Bainian Hao·Hyunwoo Lee·Robert Hildebrand·Carla Michini
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop a cutting-plane algorithm for computing pure Nash equilibria in finite integer games with shared constraints, where a deviation may be feasible against one opponent profile and infeasible against another. Conditional equilibrium inequalities capture this dependence through an explicit activation term. We give affine encodings of costs and activation conditions and prove that the resulting inequalities characterize the equilibrium set exactly. Embedded as lazy constraints in branch-and-cut, they yield the Generalized Zero-Regret algorithm for optimizing a linear objective over exact or approximate equilibria; a bisection procedure maintains certified bounds on the smallest achievable approximation factor. We also prove that, when the conditional polytopes have integral vertices, a concave cost is constant on the minimal face containing an equilibrium strategy, so strict concavity forces vertex strategies; for uniform integer-splittable bin packing, a cost-preserving transformation yields vertex equilibria even without strict concavity. We give formulations for bin packing, network formation, and knapsack games with shared capacities and evaluate the algorithm on 3,300 instances, computing a socially optimal equilibrium on all but 43, certifying nonexistence on 16, and certifying approximation factors within a few percent where no exact equilibrium exists.

Explore related subjects

math.OCcs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bainian Hao, Hyunwoo Lee, Robert Hildebrand, Carla Michini. 2026-10-03. Computing Equilibria in Integer Programming Games with Shared Constraints. https://arxiv.org/abs/2610.04279

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

KEEP EXPLORING

Related papers

arXiv2026

Non-convex optimal control governed by nonlinear elliptic partial differential equation: Analysis, functional-based algorithm and control landscape

Non-convex optimal control arises from various applications but may contain multiple stationary points. Classical solvers usually perform a local search and therefore rely on good initial guesses to reach appropriate local optimal controls. In this work we introduce a novel solution strategy for the non-convex optimal control of an elliptic equation, the main idea of which is to construct the control landscape based on the functional high-index saddle dynamics (FHiSD) method. This method reduces the dependence on prescribed initial guesses by using the information of high-index saddle points, and depicts the macroscopic configuration of the space of the control variable. Then various minima could be systematically computed along transition pathways and the control strategy can then be selected among them. We prove the existence of the optimal control, and then propose and analyze the FHiSD in locating saddle points. Subsequently, the applicability of FHiSD in non-convex optimal control is rigorously justified. Numerical results not only indicate the effectiveness of the proposed method, but reveal unintuitive phenomena (e.g. the non-monotonicity of the values of the cost functional with respect to the Morse indices) that support the necessity of computing multiple solutions of high indices.

math.OC↗
arXiv2026

Mathematical model for sustainable fisheries resource management accounting for size spectrum

This paper proposes a novel modelling and control framework for growth models that incorporate a size spectrum in conjunction with numerical computation and extensive field surveys. In fisheries management, the size spectrum, characterized by individual differences in body weight and length, is a critical factor, as it influences the physiology and ecology of fish, as well as the preferences of anglers. However, a comprehensive theoretical framework for fisheries modelling and management that accounts for the size spectrum has yet to be established. We apply a growth model that considers the size spectrum to Plecoglossus altivelis altivelis (Ayu), an important inland fisheries resource in Japan. Additionally, we introduce a novel stochastic control theory for the resource management of Ayu, taking its size spectrum into account. The growth model is calibrated using data collected annually from a river system in Japan. Our control problem addresses the size spectrum of fishing benefits and terminal utility (nonlinear expectation) for sustainability, resulting in a nonstandard problem to which the dynamic programming principle does not apply. We address this difficulty using a time-inconsistent formalism, where solving the control problem is reduced to finding an appropriate solution to a system of nonlinear partial differential equations. We numerically compute the system using the finite difference method and explore the fisheries management of Ayu at the study site.

math.OC↗
arXiv2026

The Value of Information in Resource-Constrained Pricing

Firms that price perishable resources -- airline seats, hotel rooms, seasonal inventory -- now routinely use demand predictions, but these predictions vary widely in quality. Under hard capacity constraints, acting on an inaccurate prediction can irreversibly deplete inventory needed for future periods. We study how prediction uncertainty propagates into dynamic pricing decisions with linear demand, stochastic noise, and finite capacity. A certified demand forecast with known error bound~$ε^0$ specifies where the system should operate: it shifts regret from $O(\sqrt{T})$ to $O(\log T)$ when $ε^0 \lesssim T^{-1/4}$, and we prove this threshold is tight. A misspecified surrogate model -- biased but correlated with true demand -- cannot set prices directly but reduces learning variance by a factor of $(1-ρ^2)$ through control variates. The two mechanisms compose: the forecast determines the regret regime; the surrogate tightens estimation within it. All algorithms rest on a boundary attraction mechanism that stabilizes pricing near degenerate capacity boundaries without requiring non-degeneracy assumptions. Experiments confirm the phase transition threshold, the variance reduction from surrogates, and robustness across problem instances.

math.OC↗