Abstract
The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have not been previously studied in the context of infinite games, and they offer alternatives to the classical strategy-improvement algorithms. The two algorithms are described purely in terms of discounted games, thus bypassing the reduction from the games to LCPs, and hence facilitating a better understanding of the algorithms when applied to games. A family of parity games is given, on which both algorithms run in exponential time, indicating that in the worst case they perform no better for parity, average-reward, or discounted games than they do for general P-matrix LCPs.
An extended version of this paper with full proofs is available as arXiv:0909.5653.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, I., Megiddo, N.: A Simplex Algorithm whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension. Journal of the ACMÂ 32(4), 871â895 (1985)
Björklund, H., Vorobyov, S.: A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games. Discrete Applied Mathematics 155(2), 210â229 (2007)
Chung, S.J.: NP-Completeness of the Linear Complementarity Problem. Journal of Optimization Theory and Applications 60(3), 393â399 (1989)
ChvĂĄtal, V.: Linear Programming. Freeman, New York (1983)
Condon, A.: On Algorithms for Simple Stochastic Games. In: Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 51â73. American Mathematical Society (1993)
Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, London (1992)
Emerson, E.A., Jutla, C.S., Sistla, A.P.: On Model-Checking for Fragments of ÎŒ-Calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 385â396. Springer, Heidelberg (1993)
Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
Friedman, O.: A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know It. In: Logic in Computer Science (LICS). IEEE, Los Alamitos (to appear, 2009)
GĂ€rtner, B., RĂŒst, L.: Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. In: LiĆkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 209â220. Springer, Heidelberg (2005)
Gillette, D.: Stochastic Games with Zero Stop Probabilities. In: Contributions to the Theory of Games, pp. 179â187. Princeton University Press, Princeton (1957)
GrÀdel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)
JurdziĆski, M.: Deciding the Winner in Parity Games Is in UP â©Â co-UP. Information Processing Letters 68(3), 119â124 (1998)
JurdziĆski, M., Savani, R.: A Simple P-Matrix Linear Complementarity Problem for Discounted Games. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 283â293. Springer, Heidelberg (2008)
Melekopoglou, M., Condon, A.: On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes. ORSA Journal on Computing 6, 188â192 (1994)
Puri, A.: Theory of Hybrid Systems and Discrete Event Systems. PhD Thesis, University of California, Berkeley (1995)
Shapley, L.S.: Stochastic Games. Proceedings of the National Academy of Sciences of the United States of America 39(10), 1095â1100 (1953)
Stirling, C.: Local Model Checking Games (Extended abstract). In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 1â11. Springer, Heidelberg (1995)
Svensson, O., Vorobyov, S.: Linear Complementarity and P-Matrices for Stochastic Games. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol. 4378, pp. 409â423. Springer, Heidelberg (2007)
Vöge, J., JurdziĆski, M.: A Discrete Strategy Improvement Algorithm for Solving Parity Games (Extended abstract). In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202â215. Springer, Heidelberg (2000)
Zwick, U., Paterson, M.: The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science 158, 343â359 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fearnley, J., JurdziĆski, M., Savani, R. (2010). Linear Complementarity Algorithms for Infinite Games. In: van Leeuwen, J., Muscholl, A., Peleg, D., PokornĂœ, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)