Results 1  10
of
2,253
Interactive Control of Avatars Animated with Human Motion Data
, 2002
"... Realtime control of threedimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, however, because a large repertoire of avatar behaviors must be made available, and the user must be able to select from this s ..."
Abstract

Cited by 369 (38 self)
 Add to MetaCart
Realtime control of threedimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, however, because a large repertoire of avatar behaviors must be made available, and the user must be able to select from
Graphical Models for Game Theory
, 2001
"... We introduce a compact graphtheoretic representation for multiparty game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in onestage games represented by trees or sparse graphs. ..."
Abstract

Cited by 286 (23 self)
 Add to MetaCart
We introduce a compact graphtheoretic representation for multiparty game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in onestage games represented by trees or sparse graphs.
Evolutionary games on graphs
, 2007
"... Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to ..."
Abstract

Cited by 152 (0 self)
 Add to MetaCart
of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
The Complexity of Stochastic Games
 Information and Computation
, 1992
"... We consider the complexity of stochastic games  simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP " coNP. 1 Introduction We consider the complexity of a natural combinatorial problem ..."
Abstract

Cited by 206 (2 self)
 Add to MetaCart
problem, that of deciding the outcome of a special kind of stochastic game. A simple stochastic game (SSG) is a directed graph with three types of vertices, called max, min and average vertices. There is a special start vertex and two special sink vertices, called the 0sink and the 1sink. For simplicity
On the Synthesis of Strategies in Infinite Games
, 1995
"... . Infinite twoperson games are a natural framework for the study of reactive nonterminating programs. The effective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of infinite games (given by "gam ..."
Abstract

Cited by 192 (7 self)
 Add to MetaCart
graphs"), outline a new construction of winning strategies in finitestate games, and formulate some questions which arise for games over effectively presented infinite graphs. 1 Introduction One of the origins of automata theory over infinite strings was the interest in verifying and synthesizing
Pushdown Processes: Games and Model Checking
, 1996
"... Games given by transition graphs of pushdown processes are considered. It is shown that ..."
Abstract

Cited by 183 (8 self)
 Add to MetaCart
Games given by transition graphs of pushdown processes are considered. It is shown that
The Complexity of Mean Payoff Games on Graphs
 THEORETICAL COMPUTER SCIENCE
, 1996
"... We study the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan. We describe a pseudopolynomial time algorithm for the solution of suc ..."
Abstract

Cited by 143 (4 self)
 Add to MetaCart
We study the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan. We describe a pseudopolynomial time algorithm for the solution
Infinite games on finitely coloured graphs with applications to automata on infinite trees
 Theoret. Comput. Sci
, 1998
"... ..."
Chipfiring games on graphs
 EUROPEAN J. COMBIN
, 1991
"... We analyze the following (solitaire) game: each node of a graph contains a pile of chips, and a move consists of selecting a node with at least as many chips on it as its degree, and let it send one chip to each of its neighbors. The game terminates if there is no such node. We show that the finiten ..."
Abstract

Cited by 102 (2 self)
 Add to MetaCart
We analyze the following (solitaire) game: each node of a graph contains a pile of chips, and a move consists of selecting a node with at least as many chips on it as its degree, and let it send one chip to each of its neighbors. The game terminates if there is no such node. We show
Social Distance and Otherregarding Behavior in Dictator Games
 Comment” The American Economic Review
, 1999
"... A surprisingly large amount of otherregarding behavior is the common finding of experiments on bargaining, public goods, and trust. Elizabeth Hoffman et al. ( hereafter, HMS) ( 1996) have provided an insightful analysis of why experimental results deviate from game theoretic predictions in dictator ..."
Abstract

Cited by 162 (11 self)
 Add to MetaCart
unknown individual from some anonymous crowd but becomes an ‘‘identifiable victim’ ’ (Thomas C. Schelling 1968). 2 In order to discriminate between reciprocitybased and identifiabilitybased otherregardedness, we also used the dictator game and varied the degree of social distance. An anonymous treatment
Results 1  10
of
2,253