6 search results - page 1 / 2 » Linear Complementarity Algorithms for Infinite Games |
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
CIE
2008
Springer
14 years 25 days ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
ERSHOV
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
UAI
2004
14 years 6 days ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...