AI Chat AI Image Generator AI Video Text to Speech

A note on the complexity of integer programming games

07/26/2019

∙

by Margarida Carvalho, et al.

∙

∙

In this brief note, we prove that the existence of Nash equilibria on integer programming games is a Σ^p_2.

page 1

page 2

page 3

research

∙ 12/13/2020

Computing Nash equilibria for integer programming games

The recently defined class of integer programming games (IPG) models sit...

0 Margarida Carvalho, et al. ∙

research

∙ 10/04/2018

A Note on the Nash Equilibria of Some Multi-Player Reachability / Safety Games

In this short note we study a class of multi-player, turn-based games wi...

0 Athanasios Kehagias, et al. ∙

research

∙ 06/02/2018

Introduction to Network Games with Linear Best Responses

This note, suitable for a lecture in an advanced undergraduate or basic ...

0 Benjamin Golub, et al. ∙

research

∙ 05/12/2021

Two Influence Maximization Games on Graphs Made Temporal

To address the dynamic nature of real-world networks, we generalize comp...

0 Niclas Boehmer, et al. ∙

research

∙ 11/10/2021

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

The concept of Nash equilibrium enlightens the structure of rational beh...

0 Margarida Carvalho, et al. ∙

research

∙ 06/05/2023

Integer Programming Games: A Gentle Computational Overview

In this tutorial, we present a computational overview on computing Nash ...

0 Margarida Carvalho, et al. ∙

research

∙ 06/30/2022

A note on large deviations for interacting particle dynamics for finding mixed equilibria in zero-sum games

Finding equilibria points in continuous minimax games has become a key p...

0 Viktor Nilsson, et al. ∙