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 …
We introduce the Cut-and-Play, an efficient algorithm for computing equilibria in simultaneous non-cooperative games where players solve nonconvex and possibly …
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 …
G Dragotto, A Boukhtouta, A Lodi… - Journal of Combinatorial …, 2024 - Springer
In this work, we introduce a game-theoretic model that assesses the cyber-security risk of cloud networks and informs security experts on the optimal security strategies. Our approach …
Nash equilibrium is arguably the most fundamental concept in game theory, which is used to analyze and predict the behavior of the players. In many games, there exist multiple …
This article introduces a class of Nash games among Stackelberg players (NASPs), namely, a class of simultaneous noncooperative games where the players solve sequential …
H Lee, R Hildebrand, W Cai… - arXiv preprint arXiv …, 2024 - arxiv.org
This paper introduces a new integer programming game (IPG) named the Edge-weighted Budgeted Maximum Coverage (EBMC) game and proposes a new algorithm, the Best …
We propose a framework to compute approximate Nash equilibria in integer programming games with nonlinear payoffs, ie, simultaneous and non-cooperative games where each …
L Cho, TC Sharkey - Operations Research Forum, 2023 - Springer
This paper proposes an integer programming approach to examining Nash equilibrium solutions of a game modeling freelancer platforms. This Platform-Based Scheduling Game is …