Non-cooperative monomino games

Judith Timmer, Harry Aarts, Peter van Dorenvanck, Jasper Klomp

Research output: Book/ReportReportProfessional

48 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages15
Publication statusPublished - Sep 2011

Publication series

NameMemorandum / Department of Applied Mathematics
PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)1874-4850


  • Non-cooperative games
  • MSC-91A10
  • METIS-279194
  • IR-78153
  • Nash equilibrium
  • EWI-20616
  • Monomino games
  • MSC-91A05

Cite this