Results 11  20
of
271
The Winning Ways of Concurrent Games
"... Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an extension of concurrent games by winning conditions, specifying players ’ objectives. The introduction of winning conditions ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an extension of concurrent games by winning conditions, specifying players ’ objectives. The introduction of winning
On concurrent games with payoff
"... Abstract. The paper considers an extension of concurrent games with a payoff, i.e. a numerical value resulting from the interaction of two players. We extend a recent determinacy result on concurrent games [5] to a value theorem, i.e. a value that both players can get arbitrarily close to, whatever ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. The paper considers an extension of concurrent games with a payoff, i.e. a numerical value resulting from the interaction of two players. We extend a recent determinacy result on concurrent games [5] to a value theorem, i.e. a value that both players can get arbitrarily close to, whatever
Repairing MultiPlayer Games
"... Synthesis is the automated construction of systems from their specifications. Modern systems often consist of interacting components, each having its own objective. The interaction among the components is modeled by a multiplayer game. Strategies of the components induce a trace in the game, and th ..."
Abstract
 Add to MetaCart
the possibility of modifying the objectives of the players in order to obtain stability or to improve the social welfare. Specifically, we solve the problem of modifying the winning conditions in a given concurrent multiplayer game in a way that guarantees the existence of a Nash equilibrium. Each modification
Qualitative Concurrent Parity Games
, 2008
"... We consider 2player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ωregular winning c ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We consider 2player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We consider ωregular winning
Concurrent Reachability Games
"... An open system can be modeled as a twoplayer game between the system and its environment. At each round of the game, player 1 (the system) and player 2 (the environment) independently and simultaneously choose moves, and the two choices determine the next state of the game. Properties of open syste ..."
Abstract
 Add to MetaCart
An open system can be modeled as a twoplayer game between the system and its environment. At each round of the game, player 1 (the system) and player 2 (the environment) independently and simultaneously choose moves, and the two choices determine the next state of the game. Properties of open
Strategy improvement for concurrent reachability games
 In Proceedings of the Third Annual Conference on Quantitative Evaluation of Systems. IEEE Computer
, 2006
"... A concurrent reachability game is a twoplayer game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target state ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
A concurrent reachability game is a twoplayer game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a probability distribution over the successor states. The objective for player 1 consists in reaching a set of target
Concurrent Games with Ordered Objectives
"... Abstract. We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or Büchi) objectives, and a preorder on these objectives (for instance the counting order, where the aim is to maximise the number of objectives that are fulfilled). We study two ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or Büchi) objectives, and a preorder on these objectives (for instance the counting order, where the aim is to maximise the number of objectives that are fulfilled). We study two
Qualitative Concurrent Games with Imperfect Information
, 902
"... Abstract. We define a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor state is chosen accordingly to some fixed probabi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. We define a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor state is chosen accordingly to some fixed
Task concurrency management methodology to schedule the MPEG4 IM1 player on a highly parallel processor platform
 CODES '01
, 2001
"... ..."
The Complexity of Quantitative Concurrent Parity Games
, 2006
"... We consider twoplayer infinite games played on graphs. The games are concurrent, in that at each state the players choose their moves simultaneously and independently, and stochastic, in that the moves determine a probability distribution for the successor state. The value of a game is the maximal ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
We consider twoplayer infinite games played on graphs. The games are concurrent, in that at each state the players choose their moves simultaneously and independently, and stochastic, in that the moves determine a probability distribution for the successor state. The value of a game is the maximal
Results 11  20
of
271