Results 1 - 10 of 158

Chapter 1

by Vahab S. Mirrokni, Adrian Vetta, A. Sidoropoulous
"... Convergence Issues in Competitive Games abstract. We study the speed of convergence to approximate solutions in iterative competitive games. We also investigate the value of Nash equilibria as a measure of the cost of the lack of coordination in such games. Our basic model uses the underlying best r ..."
Abstract - Add to MetaCart
games introduced in [20]. Special cases include basic-utility games and market sharing games which we examine in depth. On the positive side we show that for basic-utility games we obtain extremely quick convergence. After just one round of iterative selfish behavior we are guaranteed to obtain a

A theoretical examination of practical game playing: Lookahead search

by Vahab Mirrokni, Nithum Thain, Adrian Vetta - In SAGT, M. Serna, Ed. Lecture Notes in Computer Science Series , 2012
"... Abstract. Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play us ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
into the future. That is, we use depth k search trees and call this approach k-lookahead search. We apply our method in five well-known settings: industrial organization (Cournot’s model); AdWord auctions; congestion games; valid-utility games and basic-utility games; cost-sharing network design games. We

On the Implications of Lookahead Search in Game Playing

by Vahab Mirrokni, Nithum Thain, Adrian Vetta , 2012
"... Abstract. Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play us ..."
Abstract - Add to MetaCart
into the future. That is, we use depth k search trees and call this approach k-lookahead search. We apply our method in five well-known settings: AdWord auctions; industrial organization (Cournot’s model); congestion games; valid-utility games and basic-utility games; cost-sharing network design games. We

Behavioral theories and the neurophysiology of reward,

by Wolfram Schultz - Annu. Rev. Psychol. , 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract - Cited by 187 (0 self) - Add to MetaCart
and microeconomic utility theory, on the understanding of these brain mechanisms. Given the space limits and the only just beginning neurophysiological studies based on game theory (Barraclough et al. 2004 GENERAL IDEAS ON REWARD FUNCTION, AND A CALL FOR THEORY Homer's Odysseus proclaims, "Whatever my

Social context games

by Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz - In WINE-08 , 2008
"... Abstract. We introduce the study of social context games. A social context game is defined by an underlying game in strategic form, and a social context consisting of an undirected graph of neighborhood among players and aggregation functions. The players and strategies in a social context game are ..."
Abstract - Cited by 14 (3 self) - Add to MetaCart
are as in the underlying game, while the players ’ utilities in a social context game are computed from their payoffs in the underlying game based on the graph of neighborhood and the aggregation functions. Examples of social context games are ranking games and coalitional congestion games. A significant challenge

Networks and Games References

by Cosma Shalizi, Evolutionary Games , 2009
"... Agents or players; “Nature ” may be a player Actions or moves Pay-off reward or punishment for each player’s action, given all the others ’ moves Single-valued utilities are actually a very dubious assumption, on basic neurological grounds (McCulloch, 1945) Game tree shows history of moves by all pl ..."
Abstract - Add to MetaCart
Agents or players; “Nature ” may be a player Actions or moves Pay-off reward or punishment for each player’s action, given all the others ’ moves Single-valued utilities are actually a very dubious assumption, on basic neurological grounds (McCulloch, 1945) Game tree shows history of moves by all

Game Theory for Heterogenous Flow Control

by Ao Tang, Lachlan L. H. Andrew - in Proc. of 42nd Annual Conf. on Information Sciences an Systems , 2008
"... Abstract—A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing network utility maximization (NUM) theory for homogeneous congestion control. Instead of a convex optimization char ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
characterization in NUM, a game with multiple convex optimizations is formulated to characterize equilibria in such a network. Examples are provided to motivate the needs of this general theory. We also provide some basic properties of the game and point out some possible future directions along this line. I.

IT Education, Girls, and Game Modding

by Ibrahim Yucel, Joseph Zupko, Magy Seif El-nasr
"... Researchers have argued that video games have great utility for learning. Games promote experiential learning and can be used to facilitate active learning. This paper examines the potential of video games in education. In particular, it examines the benefits of game modding compared to playing and/ ..."
Abstract - Add to MetaCart
Researchers have argued that video games have great utility for learning. Games promote experiential learning and can be used to facilitate active learning. This paper examines the potential of video games in education. In particular, it examines the benefits of game modding compared to playing and

Congestion games with failures -- CGFs

by Michal Penn, Maria Polukarov, Moshe Tennenholtz
"... We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents share a common set of facilities (service providers), where each service provider (SP) may fail with some known probabili ..."
Abstract - Add to MetaCart
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents share a common set of facilities (service providers), where each service provider (SP) may fail with some known

supermodularity and supermodular games

by Steven N Durlauf , Lawrence E Blume
"... Abstract The mathematical concept of supermodularity formalizes the idea of complementarity and opens the way for a rigorous treatment of monotone comparative statics and games with strategic complementarities. The approach is based on lattice methods and provides conditions under which optimal sol ..."
Abstract - Add to MetaCart
; Leontieff utility function; mixed strategy outcomes; monotone comparative statics; multiple equilibria; patent races; stochastic dominance; strategic complementarities; strategic substitutability; supermodular games; supermodularity; Tarski's fixed point th Article The concept of complementarity
Results 1 - 10 of 158