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 …
The recently-defined class of integer programming games (IPG) models situations where multiple self-interested decision makers interact, with their strategy sets represented by a …
We introduce the Cut-and-Play, an efficient algorithm for computing equilibria in simultaneous non-cooperative games where players solve nonconvex and possibly …
This article introduces a class of Nash games among Stackelberg players (NASPs), namely, a class of simultaneous noncooperative games where the players solve sequential …
C Telha, M Carvalho - Dynamic Games and Applications, 2024 - Springer
We define a framework to investigate and assess the impact of prompt and dynamic reactions to market competition in production planning problems. It depicts two firms that …
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 …
LA Guardiola, A Meca, J Puerto - Mathematics, 2021 - mdpi.com
This paper analyzes cost sharing in uncapacitated lot-sizing models with backlogging and heterogeneous costs. It is assumed that several firms participate in a consortium aiming at …
We model simultaneous, non-cooperative decision making in finite games in a mathematical programming representation. The predominant solution concept for a finite game is the …
This paper analyzes cost sharing in uncapacitated lot-sizing models with backlogging and heterogeneous costs. It is assumed that several firms participate in a consortium aiming at …