Cover Image

Generalized Nash Equilibrium Problems with Mixed-Integer Variables

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Harks, Tobias, Schwarz, Julian
Format:	Preprint
Published:	2021
Subjects:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Branch-and-Cut for Mixed-Integer Nash Equilibrium Problems
by: Duguet, Aloïs, et al.
Published: (2025)

Branch-and-Cut for Computing Approximate Equilibria of Mixed-Integer Generalized Nash Games
by: Duguet, Aloïs, et al.
Published: (2025)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
by: Schade, Jamico, et al.
Published: (2023)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
by: Takazawa, Kenjiro
Published: (2024)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
by: Ekbatani, Farbod, et al.
Published: (2026)

Distortion of Metric Voting with Bounded Randomness
by: Cai, Ziyi, et al.
Published: (2026)

Monotone Randomized Apportionment
by: Correa, José, et al.
Published: (2024)

Some variations of the secretary problem
by: Agrawal, Sarthak, et al.
Published: (2026)

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
by: Bilò, Vittorio, et al.
Published: (2025)

Unbalanced Random Matching Markets with Partial Preferences
by: Potukuchi, Aditya, et al.
Published: (2024)

Efficient Local and Tabu Search Strategies for Large-Scale Quadratic Integer Programming
by: Wang, Haibo, et al.
Published: (2024)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
by: Kevi, Eniko, et al.
Published: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
by: Csáji, Gergely
Published: (2023)

Six Candidates Suffice to Win a Voter Majority
by: Charikar, Moses, et al.
Published: (2024)

The Popular Dimension of Matchings
by: Connor, Frank, et al.
Published: (2025)

Approximately Dominating Sets in Elections
by: Charikar, Moses, et al.
Published: (2025)

Stationary Online Contention Resolution Schemes
by: Aminian, Mohammad Reza, et al.
Published: (2026)

Integer programs with bounded subdeterminants and two nonzeros per row
by: Fiorini, Samuel, et al.
Published: (2021)

Integer programs with nearly totally unimodular matrices: the cographic case
by: Aprile, Manuel, et al.
Published: (2024)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
by: Proença, Nathan Benedetto, et al.
Published: (2023)

Breaking the Metric Voting Distortion Barrier
by: Charikar, Moses, et al.
Published: (2023)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)

Combinatorial Bernoulli Factories
by: Niazadeh, Rad, et al.
Published: (2020)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans--Williamson Algorithm
by: Proença, Nathan Benedetto, et al.
Published: (2024)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
by: Fujiwara, Hiroshi, et al.
Published: (2025)

Flow Shop Scheduling with Stochastic Reentry
by: von Aspern, Maximilian, et al.
Published: (2026)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
by: Prasad, Siddharth, et al.
Published: (2024)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
by: Wang, Chenhao
Published: (2025)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
by: Gallart, Joan Vendrell, et al.
Published: (2025)

Multiplicative assignment with upgrades
by: Armbruster, Alexander, et al.
Published: (2025)

A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

Robust Optimality of Bundling Goods Beyond Finite Variance
by: van Eck, Tim S. G., et al.
Published: (2025)

Revenue Maximization in Choice-Based Matching Markets
by: Nissim, Dan, et al.
Published: (2024)

Solving Matrix Games with Near-Optimal Matvec Complexity
by: Karmarkar, Ishani, et al.
Published: (2026)

Barely Random Algorithms and Collective Metrical Task Systems
by: Cosson, Romain, et al.
Published: (2024)

Online Fair Allocation with Best-of-Many-Worlds Guarantees
by: Yang, Zongjun, et al.
Published: (2024)

Solving Zero-Sum Games with Fewer Matrix-Vector Products
by: Karmarkar, Ishani, et al.
Published: (2025)

Sequential Selection with Expirations
by: Xu, Yihua, et al.
Published: (2024)

Fare Zone Assignment on Trees
by: Hoefer, Martin, et al.
Published: (2025)