Skip to main content

Non-cooperative Monomino Games

  • Conference paper
  • First Online:
  • 745 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 758))

Abstract

In this paper we study monomino games. These are two player games played on a rectangular board with R rows and C columns. The game pieces are monominoes, which cover exactly one cell of the board. One by one each player selects a column of the board, and places a monomino in the lowest uncovered cell. This generates a payoff for the player. The game ends if all cells are covered by monominoes. The goal of each player is to place his monominoes in such a way that his total payoff is maximized. We derive the equilibrium play and corresponding payoffs for the players.

We thank the Editor and two anonymous reviewers for their helpful comments.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Albert, M., Nowakowski, R.J., Wolfe, D.: An Introduction to Combinatorial Game Theory. A K Peters, Wellesley (2007)

    MATH  Google Scholar 

  2. Borm, P., Hamers, H., Hendrickx, R.: Operations research games: a survey. TOP 9(2), 139–199 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. De Schuymer, B., De Meyer, H., De Baets, B.: Optimal strategies for equal-sum dice games. Discrete Appl. Math. 154, 2565–2576 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. van Dorenvanck, P., Klomp, J.: Optimale strategieën in dominospelen. M.Sc. thesis, University of Twente, Enschede, The Netherlands (2010). (In Dutch)

    Google Scholar 

  5. Fraenkel, A.S.: Combinatorial games: Selected bibliography with a succinct gourmet introduction. The Electronic Journal of Combinatorics, Dynamic Surveys, DS2 (2009)

    Google Scholar 

  6. Gardner, M.: Dominono. Comput. Math. Appl. 39, 55–56 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  7. Nash, J.: Non-cooperative games. Ann. Math. 54, 289–295 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  8. Orman, H.K.: Pentominoes: a first player win. In: Nowakowski, R.J. (ed.) Games of No Chance, MSRI Publications, vol. 29, pp. 339–344. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  9. Peters, H.: Game Theory: A Multi-leveled Approach. Springer, Heidelberg (2015). doi:10.1007/978-3-540-69291-1

    Book  MATH  Google Scholar 

  10. Rawsthorne, D.A.: Tiling complexity of small \(N\)-ominoes (\(N<10\)). Discrete Math. 70(1), 71–75 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Harry Aarts .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Timmer, J., Aarts, H., van Dorenvanck, P., Klomp, J. (2017). Non-cooperative Monomino Games. In: Li, DF., Yang, XG., Uetz, M., Xu, GJ. (eds) Game Theory and Applications. China GTA China-Dutch GTA 2016 2016. Communications in Computer and Information Science, vol 758. Springer, Singapore. https://doi.org/10.1007/978-981-10-6753-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6753-2_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6752-5

  • Online ISBN: 978-981-10-6753-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics