We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system
In hedonic games, players form coalitions based on individual preferences over the group of players ...
AbstractIn 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if...
Abstract. We consider two-player games with imperfect information and quan-titative objective. The g...
We study graphs and two-player games in which rewards are assigned to states, and the goal of the pl...
We study graphs and two-player games in which rewards are assigned to states, and the goal of the pl...
Multi-player mean-payoff games are a natural formalism for modelling the behaviour of concurrent and...
Many techniques developed in simulations of physical models have been adopted in studies of game the...
We consider a family of population game dynamics known as Best Experienced Payoff Dynamics. Under th...
We study a family of population game dynamics under which each revising agent randomly selects a set...
Mean-payoff games are important quantitative models for open reactive systems. They have been widely...
We consider concurrent games played by two players on a finite-state graph, where in every round the...
Evolutionarily stable strategies and their stability indices are computed for all 2-player games of ...
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each pl...
In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games ...
AbstractWe have extended a two player game-theoretical model proposed by V. Gurvich [To theory of mu...
In hedonic games, players form coalitions based on individual preferences over the group of players ...
AbstractIn 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if...
Abstract. We consider two-player games with imperfect information and quan-titative objective. The g...
We study graphs and two-player games in which rewards are assigned to states, and the goal of the pl...
We study graphs and two-player games in which rewards are assigned to states, and the goal of the pl...
Multi-player mean-payoff games are a natural formalism for modelling the behaviour of concurrent and...
Many techniques developed in simulations of physical models have been adopted in studies of game the...
We consider a family of population game dynamics known as Best Experienced Payoff Dynamics. Under th...
We study a family of population game dynamics under which each revising agent randomly selects a set...
Mean-payoff games are important quantitative models for open reactive systems. They have been widely...
We consider concurrent games played by two players on a finite-state graph, where in every round the...
Evolutionarily stable strategies and their stability indices are computed for all 2-player games of ...
In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each pl...
In this talk, I will show how one can characterize and compute Nash equilibria in multiplayer games ...
AbstractWe have extended a two player game-theoretical model proposed by V. Gurvich [To theory of mu...
In hedonic games, players form coalitions based on individual preferences over the group of players ...
AbstractIn 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if...
Abstract. We consider two-player games with imperfect information and quan-titative objective. The g...