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.
|Name||Memorandum / Department of Applied Mathematics|
|Publisher||Department of Applied Mathematics, University of Twente|
- Non-cooperative games
- Nash equilibrium
- Monomino games