Location selection for hydrogen fuel stations under emerging provider competition
T Crönert, S Minner - Transportation Research Part C: Emerging …, 2021 - Elsevier
Individual hydrogen-based mobility with fuel cell electric vehicles (FCEVs) is a promising
avenue for green house gas reduction in the transportation sector. With a rise in popularity of …
avenue for green house gas reduction in the transportation sector. With a rise in popularity of …
Subsidy Allocation Problem with Bus Frequency Setting Game: A Trilevel Formulation and Exact Algorithm
Typically, governments subcontract the operation of urban bus systems to several bus
operators. In particular, the government aims to promote the service quality for passengers …
operators. In particular, the government aims to promote the service quality for passengers …
Integer programming games: a gentle computational overview
In this tutorial, we present a computational overview on computing Nash equilibria in integer
programming games (IPGs), that is, how to compute solutions for a class of noncooperative …
programming games (IPGs), that is, how to compute solutions for a class of noncooperative …
The zero regrets algorithm: Optimizing over pure Nash equilibria via integer programming
Designing efficient algorithms to compute Nash equilibria poses considerable challenges in
algorithmic game theory and optimization. In this work, we employ integer programming …
algorithmic game theory and optimization. In this work, we employ integer programming …
The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
We introduce the Cut-and-Play, an efficient algorithm for computing equilibria in
simultaneous non-cooperative games where players solve nonconvex and possibly …
simultaneous non-cooperative games where players solve nonconvex and possibly …
Copositive duality for discrete markets and games
Optimization problems with discrete decisions are nonconvex and thus lack strong duality,
which limits the usefulness of tools such as shadow prices and the KKT conditions. It was …
which limits the usefulness of tools such as shadow prices and the KKT conditions. It was …
A branch-and-prune algorithm for discrete Nash equilibrium problems
S Schwarze, O Stein - Computational Optimization and Applications, 2023 - Springer
We present a branch-and-prune procedure for discrete Nash equilibrium problems with a
convex description of each player's strategy set. The derived pruning criterion does not …
convex description of each player's strategy set. The derived pruning criterion does not …
Equilibrium identification and selection in finite games
T Crönert, S Minner - Operations Research, 2024 - pubsonline.informs.org
Finite games provide a framework to model simultaneous competitive decisions among a
finite set of players (competitors), each choosing from a finite set of strategies. Potential …
finite set of players (competitors), each choosing from a finite set of strategies. Potential …
Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
When determining store locations, competing retailers must take customers' store choice into
consideration. Customers predominantly select which store to visit based on price …
consideration. Customers predominantly select which store to visit based on price …
Generalized Nash equilibrium problems with mixed-integer variables
T Harks, J Schwarz - Mathematical Programming, 2024 - Springer
We consider generalized Nash equilibrium problems (GNEPs) with non-convex strategy
spaces and non-convex cost functions. This general class of games includes the important …
spaces and non-convex cost functions. This general class of games includes the important …