Algorithms for Closed Under Rational Behavior (CURB) Sets

01/16/2014
by   Michael Benisch, et al.
0

We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-player, normal-form games can be computed in polynomial time (we also discuss extensions to n-player games). First, we describe an algorithm that identifies all of a player's best responses conditioned on the belief that the other player will play from within a given subset of its strategy space. This algorithm serves as a subroutine in a series of polynomial-time algorithms for finding all minimal CURB sets, one minimal CURB set, and the smallest minimal CURB set in a game. We then show that the complexity of finding a Nash equilibrium can be exponential only in the size of a game's smallest CURB set. Related to this, we show that the smallest CURB set can be an arbitrarily small portion of the game, but it can also be arbitrarily larger than the supports of its only enclosed Nash equilibrium. We test our algorithms empirically and find that most commonly studied academic games tend to have either very large or very small minimal CURB sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2021

Game Transformations that preserve Nash Equilibrium sets and/or Best Response sets

In the literature on simultaneous non-cooperative games, it is well-know...
research
09/28/2018

Effect of information asymmetry in Cournot duopoly game with bounded rationality

We investigate the effect of information asymmetry on a dynamic Cournot ...
research
09/05/2018

The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson

Extensive study on the complexity of computing Nash Equilibrium has resu...
research
12/04/2019

Deep Fictitious Play for Finding Markovian Nash Equilibrium in Multi-Agent Games

We propose a deep neural network-based algorithm to identify the Markovi...
research
09/30/2020

Complexity and Algorithms for Exploiting Quantal Opponents in Large Two-Player Games

Solution concepts of traditional game theory assume entirely rational pl...
research
02/17/2019

Limited Lookahead in Imperfect-Information Games

Limited lookahead has been studied for decades in complete-information g...
research
09/02/2021

The Weihrauch degree of finding Nash equilibria in multiplayer games

Is there an algorithm that takes a game in normal form as input, and out...

Please sign up or login with your details

Forgot password? Click here to reset