The "Number Hides Game" on a Tree

A bachelor thesis in game theory

Bachelor thesis (2022)

Authors

B.J.A. Swinkels Electrical Engineering, Mathematics and Computer Science

Contributors

R.J. Fokkink Applied Probability - EEMCS (mentor)
L.J.J. van Iersel Discrete Mathematics and Optimization - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2022 Bart Swinkels
More Info
expand_more

Published Date

16-08-2022

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

The "Number Hides Game" (NHG) is 2-player game played on a board that consists of a row of p consecutive coins. Player I and player II simultaneously choose subsets of m and n consecutive coins respectively. Player II pays the number of coins that lie in the intersection of the subsets to player I. This thesis introduces basic knowledge from the field of game theory needed to analyse the game. Afterwards, it presents and proves the optimal strategies of the NHG. Finally, a variant of the NHG will be discussed in which the board consist of a general tree instead of a row.

Files

BJASwinkels_TheNumberHidesGame... (pdf)
(pdf | 2.15 Mb)
Unknown license