Skip to main content
SpringerLink
Log in

Solution Techniques for Quantified Linear Programs and the Links to Gaming

  • Conference paper
  • First Online:
Book cover Computers and Games (CG 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8427))

Included in the following conference series:

Abstract

Quantified linear programs (QLPs) are linear programs (LPs) with variables being either existentially or universally quantified. QLPs are two-person zero-sum games between an existential and a universal player on the one side, and convex multistage decision problems on the other side. Solutions of feasible QLPs are so called winning strategies for the existential player that specify how to react on moves – well-thought fixations of universally quantified variables – of the universal player to be sure to win the game. To find a certain best strategy among different winning strategies, we propose the extension of the QLP decision problem by an objective function. To solve the resulting QLP optimization problem, we exploit the problem’s hybrid nature and combine linear programming techniques with solution techniques from game-tree search. As a result, we present an extension of the Nested Benders Decomposition algorithm by the \(\alpha \beta \)-algorithm and its heuristical move-ordering as used in game-tree search to solve minimax trees. The applicability of our method to both QLPs and models of PSPACE-complete games such as Connect6 is examined in an experimental evaluation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Heed that this transformation is only valid if \(n\) is a power of 2. It can be easily adopted to the general case.

References

  1. Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-number search. Artif. Intell. 66(1), 91–124 (1994)

    Article  MATH  Google Scholar 

  2. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238–252 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  3. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering. Springer, New York (1997)

    MATH  Google Scholar 

  4. Donninger, C., Lorenz, U.: The hydra project. Xcell J. (53), 94–97 (2005)

    Google Scholar 

  5. Ederer, T., Lorenz, U., Martin, A., Wolf, J.: Quantified linear programs: a computational study. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 203–214. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Ederer, T., Lorenz, U., Opfer, T., Wolf, J.: Modeling games with the help of quantified integer linear programs. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 270–281. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Hsu, F.H.: Ibm’s deep blue chess grandmaster chips. IEEE Micro 18(2), 70–80 (1999)

    Google Scholar 

  8. Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293–326 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lorenz, U., Martin, A., Wolf, J.: Polyhedral and algorithmic properties of quantified linear programs. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 512–523. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Papadimitriou, C.H.: Games against nature. J. Comput. Syst. Sci. 31, 288–301 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  11. Pijls, W., de Bruin, A.: Game tree algorithms and solution trees. Theor. Comput. Sci. 252(1–2), 197–215 (2001)

    Article  MATH  Google Scholar 

  12. Plaat, A., Schaeffer, J., Pijls, W., De Bruin, A.: Best-first fixed-depth game-tree search in practice. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, San Francisco, CA, USA, vol. 1, pp. 273–279. Morgan Kaufmann Publishers Inc. (1995)

    Google Scholar 

  13. Subramani, K.: Analyzing selected quantified integer programs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 342–356. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Subramani, K.: On a decision procedure for quantified linear programs. Ann. Math. Artif. Intell. 51(1), 55–77 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. van den Herik, H.J., Nunn, J., Levy, D.: Adams outclassed by hydra. ICGA J. 28(2), 107–110 (2005)

    Google Scholar 

  16. van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijk, J.: Games solved: now and in the future. Artif. Intell. 134, 277–312 (2002)

    Article  MATH  Google Scholar 

  17. Vanderbeck, F., Wolsey, L.: Reformulation and decomposition of integer programs. CORE Discussion Papers 2009016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) (2009)

    Google Scholar 

  18. Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: PDS-PN: a new proof-number search algorithm. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 61–74. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Acknowledgements

This research is partially supported by German Research Foundation (DFG) funded SFB 805 and by the DFG project LO 1396/2–1.

Author information

Authors and Affiliations

  1. Fluid Systems Technology, Technische Universität Darmstadt, Darmstadt, Germany

    Ulf Lorenz, Thomas Opfer & Jan Wolf

Authors
  1. Ulf Lorenz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Opfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Opfer .

Editor information

Editors and Affiliations

  1. Tilburg University, Tilburg, The Netherlands

    H. Jaap van den Herik

  2. JAIST, Ishikawa, Japan

    Hiroyuki Iida

  3. Tilburg University, Tilburg, The Netherlands

    Aske Plaat

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lorenz, U., Opfer, T., Wolf, J. (2014). Solution Techniques for Quantified Linear Programs and the Links to Gaming. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09165-5_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09164-8

  • Online ISBN: 978-3-319-09165-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation