Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
151
unknown title
"... that of optimal. For n-player valid-utility games, in general, after one round we obtain a ..."
Abstract
- Add to MetaCart
that of optimal. For n-player valid-utility games, in general, after one round we obtain a
Convergence issues in competitive games
- In APPROX-RANDOM
, 2004
"... 3 that of optimal. For n-player valid-utility games, in general, after one round we obtain a 1 2n-approximate solution. For market sharing games we prove that one round of selfish response behavior of playersgives \Omega ( ..."
Abstract
-
Cited by 48 (9 self)
- Add to MetaCart
3 that of optimal. For n-player valid-utility games, in general, after one round we obtain a 1 2n-approximate solution. For market sharing games we prove that one round of selfish response behavior of playersgives \Omega (
Chapter 1
"... 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
-cooperative games in that we dispense with the insistence upon only evaluating Nash equilibria. A detailed theoretical and practical justification for this approach is presented. We consider non-cooperative games with a submodular social utility function; in particular, we focus upon the class of valid-utility
A theoretical examination of practical game playing: Lookahead search
- 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
Price of Anarchy for theN-player Competitive Cascade Game with Submodular Activation Functions
"... Abstract. We study the Price of Anarchy (PoA) of the competitive cascade game following the framework proposed by Goyal and Kearns in [11]. Our main insight is that a reduction to a Linear Threshold Model in a time-expanded graph establishes the submodularity of the social utility func-tion. From th ..."
Abstract
- Add to MetaCart
this observation, we deduce that the game is a valid utility game, which in turn implies an upper bound of 2 on the (coarse) PoA. This cleaner understanding of the model yields a simpler proof of a much more general result than that established by Goyal and Kearns: for the N-player competitive cascade game
Bounding the inefficiency of altruism through social contribution games
- In Proc. 9th Conference On Web and Internet Economics
, 2013
"... Abstract. We introduce a new class of games, called social contribution games (SCGs), where each player’s individual cost is equal to the cost he induces on society because of his presence. Our results reveal that SCGs constitute useful abstractions of altruistic games when it comes to the analysis ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
technique. Examples include min-sum scheduling games, congestion games, second-price auctions and valid utility games. Using our technique, we derive mostly tight bounds on the robust price of anarchy of their altruistic extensions. For the majority of the mentioned game classes, the results extend
On the Implications of Lookahead Search in Game Playing
, 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
Altruism and Its Impact on the Price of Anarchy
, 2014
"... We study the inefficiency of equilibria for congestion games when players are (partially) altruistic. We model altruistic behavior by assuming that player i’s perceived cost is a convex combination of 1−αi times his direct cost and αi times the social cost. Tuning the parameters αi allows smooth int ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
interpolation between purely selfish and purely altruistic behavior. Within this framework, we study primarily altruistic extensions of (atomic and non-atomic) congestion games, but also obtain some results on fair cost-sharing games and valid utility games. We derive (tight) bounds on the price of anarchy
On the Complexity of Nash Dynamics and Sink equilibria
, 2009
"... Studying Nash dynamics is an important approach for analyzing the outcome of games with repeated selfish behavior of self-interested agents. Sink equilibria has been introduced by Goemans, Mirrokni, and Vetta for studying social cost on Nash dynamics over pure strategies in games. However, they do n ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
equilibrium (i.e, a sink equilibrium with one state)? In this paper, we almost answer all of the above questions for a variety of classes of games with succinct representation, including anonymous games, player-specific and weighted congestion games, valid-utility games, and two-sided market games
Power and performance management of virtualized computing environments via lookahead control.
- In Proc. Fifth Int’l Conference on Autonomic Computing,
, 2008
"... Abstract There is growing incentive to reduce the power consumed by large-scale data centers that host online services such as banking, retail commerce, and gaming. Virtualization is a promising approach to consolidating multiple online services onto a smaller number of computing resources. A virtu ..."
Abstract
-
Cited by 138 (6 self)
- Add to MetaCart
quality-of-service (QoS) while achieving higher server utilization and energy efficiency. We implement and validate a dynamic resource provisioning framework for virtualized server environments wherein the provisioning problem is posed as one of sequential optimization under uncertainty and solved using a
Results 1 - 10
of
151
