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

10/29/2021
by   Emanuel Tewolde, et al.
0

In the literature on simultaneous non-cooperative games, it is well-known that a positive affine (linear) transformation (PAT) of the utility payoffs do not change the best response sets and the Nash equilibrium set. PATs have been successfully used to expand the classes of 2-player games for which we can compute a Nash equilibrium in polynomial time. We investigate which game transformations other than PATs also possess one of the following properties: (i) The game transformation shall not change the Nash equilibrium set when being applied on an arbitrary game. (ii) The game transformation shall not change the best response sets when being applied on an arbitrary game. First, we prove that property (i) implies property (ii). Over a series of further results, we derive that game transformations with property (ii) must be positive affine. Therefore, we obtained two new and equivalent characterisations with game theoretic meaning for what it means to be a positive affine transformation. All our results in particular hold for the 2-player case of bimatrix games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2023

Game Connectivity and Adaptive Dynamics

We analyse the typical structure of games in terms of the connectivity p...
research
07/31/2023

A game-theoretic analysis of baccara chemin de fer, II

In a previous paper, we considered several models of the parlor game bac...
research
01/16/2014

Algorithms for Closed Under Rational Behavior (CURB) Sets

We provide a series of algorithms demonstrating that solutions according...
research
09/15/2022

Valid Utility Games with Information Sharing Constraints

The use of game theoretic methods for control in multiagent systems has ...
research
04/08/2019

A Manifold of Polynomial Time Solvable Bimatrix Games

This paper identifies a manifold in the space of bimatrix games which co...
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...
research
01/26/2022

An Efficient Approximation Algorithm for the Colonel Blotto Game

In the storied Colonel Blotto game, two colonels allocate a and b troops...

Please sign up or login with your details

Forgot password? Click here to reset