Displaying similar documents to “Game-theoretic algorithms for fair and strongly fair cake division with entitlements”

A mixed duel under arbitrary motion and uncertain existence of the shot

Stanisław Trybuła (1993)

Applicationes Mathematicae

Similarity:

The purpose of the paper is to solve a mixed duel in which the numbers of shots given to the players are independent 0-1-valued random variables. The players know their distributions as well as the accuracy function P, the same for both players. It is assumed that the players can move as they like and that the maximal speed of the first player is greater than that of the second player. It is shown that the game has a value, and a pair of optimal strategies is found.

Discrete bidding games.

Develin, Mike, Payne, Sam (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Permissive strategies: from parity games to safety games

Julien Bernet, David Janin, Igor Walukiewicz (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler...