The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Envy-free cake divisions cannot be found by finite protocols.”

Dynamic one-pile blocking Nim.

Flammenkamp, Achim, Holshouser, Arthur, Reiter, Harold (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Evolving small-board Go players using coevolutionary temporal difference learning with archives

Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively...

Two pile move-size dynamic Nim.

Holshouser, Arthur, Reiter, Harold (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Core solutions and nash equilibria in noncooperative games with a measure space of players

Sjur Didrik Flåm, Andrzej Wieczorek (2006)

Banach Center Publications

Similarity:

The paper deals with noncooperative games in which players constitute a measure space. Strategy profiles that are equal almost everywhere are assumed to have the same interactive effects. Under these circumstances we explore links between core solutions and Nash equilibria. Conditions are given which guarantee that core outcomes must be Nash equilibria and vice versa. The main contribution are results on nonemptieness of the core.