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 …

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 …

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 …

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 …

We present ZERO, a modular and extensible C++ library interfacing Mathematical
Programming and Game Theory. ZERO provides a comprehensive toolkit of modeling …

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 …