A Simple P-Matrix Linear Complementarity Problem for Discounted Games

DOI10.1007/978-3-540-69407-6_32zbMath1142.91307OpenAlexW2100114422MaRDI QIDQ3507443

Rahul Savani, Marcin Jurdziński

Publication date: 19 June 2008

Published in: Logic and Theory of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69407-6_32

zbMATH Keywords

linear complementarity problemzero-sum gameP-matrixunique sink orientationstrategy improvement algorithmDiscounted game

Mathematics Subject Classification ID

2-person games (91A05) Stochastic games, stochastic differential games (91A15)

Related Items (5)

Towards solving 2-TBSG efficiently ⋮ Completely mixed strategies for two structured classes of semi-Markov games, principal pivot transform and its generalizations ⋮ Generalized principal pivot transforms, complementarity theory and their applications in stochastic games ⋮ Unnamed Item ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• Complementary pivot theory of mathematical programming
• Finite state Markovian decision processes
• Linear Complementarity and P-Matrices for Stochastic Games
• Unique Sink Orientations of Grids
• Jumping Doesn’t Help in Abstract Cubes
• Matrix Analysis
• Linear complementarity problems solvable by A single linear program
• Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
• Convex sets of nonsingular and P:–Matrices
• Fundamentals of Computation Theory
• Bimatrix Equilibrium Points and Mathematical Programming
• Stochastic Games

This page was built for publication: A Simple P-Matrix Linear Complementarity Problem for Discounted Games