Iterative Computation of Security Strategies of Matrix Games with Growing Action Set

11/07/2017
by   Lichun Li, et al.
0

This paper studies how to efficiently update the saddle-point strategy, or security strategy of one player in a matrix game when the other player develops new actions in the game. It is well known that the saddle-point strategy of one player can be computed by solving a linear program. Developing a new action will add a new constraint to the existing LP. Therefore, our problem becomes how to solve the new LP with a new constraint efficiently. Considering the potentially huge number of constraints, which corresponds to the large size of the other player's action set, we use shadow vertex simplex method, whose computational complexity is lower than linear with respect to the size of the constraints, as the basis of our iterative algorithm. We first rebuild the main theorems in shadow vertex method with relaxed assumption to make sure such method works well in our model, then analyze the probability that the old optimum remains optimal in the new LP, and finally provides the iterative shadow vertex method whose computational complexity is shown to be strictly less than that of shadow vertex method. The simulation results demonstrates our main results about the probability of re-computing the optimum and the computational complexity of the iterative shadow vertex method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/07/2017

Security Strategies of Both Players in Asymmetric Information Zero-Sum Stochastic Games with an Informed Controller

This paper considers a zero-sum two-player asymmetric information stocha...
research
08/24/2020

LP Formulations of Two-Player Zero-Sum Stochastic Bayesian games

This paper studies two-player zero-sum stochastic Bayesian games where e...
research
08/20/2021

On the Computational Complexities of Various Geography Variants

Generalized Geography is a combinatorial game played on a directed graph...
research
05/03/2022

A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes

The study of the fundamental limits of information systems is a central ...
research
07/30/2021

The Pyro game: a slow intelligent fire

In the Firefighter problem, a fire breaks out at a vertex of a graph and...
research
08/15/2012

A Novel Strategy Selection Method for Multi-Objective Clustering Algorithms Using Game Theory

The most important factors which contribute to the efficiency of game-th...
research
05/06/2020

Sparktope: linear programs from algorithms

In a recent paper Avis, Bremner, Tiwary and Watanabe gave a method for c...

Please sign up or login with your details

Forgot password? Click here to reset