In the ultimatum game, two players are asked to split a certain sum of money. The proposer has to make an offer. If the responder accepts the offer, the money will be shared accordingly. If the responder rejects the offer, both players receive nothing. The rational solution is for the proposer to offer the smallest possible share, and for the responder to accept it. Human players, in contrast, ...

We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (G)k∈K . The sequence of states follows the Markov chain. At the beginning of each stage, only player 1 is informed of the current state k, then the game G is played, the actions played are observed by both players and the play proceeds to the next stage. We call su...

Multi-target visual tracking is a challenge because of data association and mutual occlusion in the interacting targets. This paper presents a Gaussian mixture probability hypothesis density based multitarget visual tracking system with game-theoretical occlusion handling. Firstly, the spatial constraint based appearance model with other interacting targets’ interferences is modeled. Then, a tw...

We consider a general notion of coalgebraic game, whereby games are viewed as elements of a final coalgebra. This allows for a smooth definition of game operations (e.g. sum, negation, and linear implication) as final morphisms. The notion of coalgebraic game subsumes different notions of games, e.g. possibly non-wellfounded Conway games and games arising in Game Semantics à la [AJM00]. We defi...

This paper considers the problem of patrolling multiple targets in a Euclidean environment by a single patrolling unit. We use game-theoretic approach and model the problem as a two-player zero-sum game in the extensive form. Based on the existing work in the domain of patrolling we propose a novel mathematical non-linear program for finding strategies in a discretized problem, in which we intr...

In this paper, we investigate the rational synthesis problem for concurrent game structure for a variety of objectives ranging from reachability to Muller condition. We propose a new algorithm that establishes the decidability of the non cooperative rational synthesis problem that relies solely on game theoretic technique as opposed to previous approaches that are logic based. Thanks to this ap...