Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Other Mathematics
Winning Strategies In The Board Game Nowhere To Go, Najee Kahil Mcfarland-Drye
Winning Strategies In The Board Game Nowhere To Go, Najee Kahil Mcfarland-Drye
Senior Projects Spring 2016
Nowhere To Go is a two player board game played on a graph. The players take turns placing blockers on edges, and moving from vertex to vertex using unblocked edges and unoccupied vertices. A player wins by ensuring their opponent is on a vertex with all blocked edges. This project goes over winning strategies for Player 1 for Nowhere To Go on the standard board and other potential boards.
Envy-Free Fair Division With Two Players And Multiple Cakes, Justin J. Shin
Envy-Free Fair Division With Two Players And Multiple Cakes, Justin J. Shin
Senior Projects Fall 2016
When dividing a valuable resource amongst a group of players, it is desirable to have each player believe that their allocation is at least as valuable as everyone else's allocation. This condition, where nobody is envious of anybody else's share in a division, is called envy-freeness. Fair division problems over continuous pools of resources are affectionately known as cake-cutting problems, as they resemble attempts to slice and distribute cake amongst guests as fairly as possible. Previous work in multi-cake fair division problems have attempted to prove that certain conditions do not allow for guaranteed envy-free divisions. In this paper, we …