One-person solitaire-like games are explored with a view to using them in teaching algorithmic problem solving. The key to understanding solutions to such games is the identification of invariant properties of polynomial arithmetic. We demonstrate this via three case studies: solitaire itself, tiling problems and a novel class of one-person games. The known classification of states of the game ...

We conjecture that the thought processes used to solve dominant strategy games and mixed strategy games are quite distinct. Two-person games with dominant strategies can be treated as simple decision problems that involve no assessment of one’s partner. By contrast, two-person games with mixed strategies require that one think about one’s partner. We measure differences in electroencephalogram ...

We conjecture that the thought processes used to solve dominant strategy games and mixed strategy games are quite distinct. Two-person games with dominant strategies can be treated as simple decision problems that involve no assessment of one's partner. By contrast, two-person games with mixed-strategies require that one think about one's partner. We measure differences in electroencephalogram ...

In this paper, we review the development of studies on multiobjective noncooperative games, and particularly we focus on nondominated equilibrium solutions in multiobjective two-person nonzero-sum games in normal and extensive forms. After outlining studies related to multiobjective noncooperative games, we treat multiobjective two-person nonzero-sum games in normal form, and a mathematical pro...