The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations

11/10/2021
by   Margarida Carvalho, et al.
0

The concept of Nash equilibrium enlightens the structure of rational behavior in multi-agent settings. However, the concept is as helpful as one may compute it efficiently. We introduce the Cut-and-Play, an algorithm to compute Nash equilibria for non-cooperative simultaneous games where each player's objective is linear in their variables and bilinear in the other players' variables. Using the rich theory of integer programming, we alternate between constructing (i.) increasingly tighter outer approximations of the convex hull of each player's feasible set – by using branching and cutting plane methods – and (ii.) increasingly better inner approximations of these hulls – by finding extreme points and rays of the convex hulls. In particular, we prove the correctness of our algorithm when these convex hulls are polyhedra. Our algorithm allows us to leverage the mixed integer programming technology to compute equilibria for a large class of games. Further, we integrate existing cutting plane families inside the algorithm, significantly speeding up equilibria computation. We showcase a set of extensive computational results for Integer Programming Games and simultaneous games among bilevel leaders. In both cases, our framework outperforms the state-of-the-art in computing time and solution quality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/05/2023

Integer Programming Games: A Gentle Computational Overview

In this tutorial, we present a computational overview on computing Nash ...
research
11/11/2021

ZERO Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming

In Algorithmic Game Theory (AGT), designing efficient algorithms to comp...
research
07/26/2019

A note on the complexity of integer programming games

In this brief note, we prove that the existence of Nash equilibria on in...
research
07/21/2020

Outer approximations of core points for integer programming

For several decades the dominant techniques for integer linear programmi...
research
05/29/2019

Extra-gradient with player sampling for provable fast convergence in n-player games

Data-driven model training is increasingly relying on finding Nash equil...
research
11/15/2021

ZERO: Playing Mathematical Programming Games

We present ZERO, a modular and extensible C++ library interfacing Mathem...
research
11/21/2017

Robust Stackelberg Equilibria in Extensive-Form Games and Extension to Limited Lookahead

Stackelberg equilibria have become increasingly important as a solution ...

Please sign up or login with your details

Forgot password? Click here to reset