338 Hits in 4.8 sec

Nash Social Welfare in Selfish and Online Load Balancing [article]

Vittorio Bilò, Gianpiero Monaco, Luca Moscardelli, Cosimo Vinci
2020 arXiv   pre-print
We revisit both selfish and online load balancing under the objective of minimizing the Nash Social Welfare, i.e., the geometric mean of the clients' costs.  ...  To the best of our knowledge, despite being a celebrated welfare estimator in many social contexts, the Nash Social Welfare has not been considered so far as a benchmarking quality measure in load balancing  ...  Online Load Balancing. The performance of greedy load balancing with respect to the utilitarian social welfare and under affine latency functions has been studied in [7, 22, 59 ].  ... 
arXiv:2007.08263v1 fatcat:z35dy4qotzhjtocpktmtkeker4

Selfish load balancing and atomic congestion games

Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2004 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '04  
We revisit a classical load balancing problem in the modern context of decentralized systems and self-interested clients.  ...  This interaction is naturally modeled as an atomic congestion game, which we call selfish load balancing.  ...  Unlike traditional load balancing, however, the clients are not interested in optimizing the social welfare (e.g., total system-wide latency). Instead, each client has its own private objective.  ... 
doi:10.1145/1007912.1007941 dblp:conf/spaa/SuriTZ04 fatcat:n7re4ukklzbrbjedujwhwmvysa

Uncoordinated Load Balancing and Congestion Games in P2P Systems [chapter]

Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2005 Lecture Notes in Computer Science  
where user groups are dynamic, as well as the complexity of finding Nash solutions, and incentives for peers to be truthful in revealing their load.  ...  This interaction is best modeled as a game among self-interested agents, which we call uncoordinated load balancing.  ...  Unlike traditional load balancing, however, users are not interested in optimizing the social welfare (e.g., total response time). Instead, each user has its own private objective.  ... 
doi:10.1007/978-3-540-30183-7_12 fatcat:vacinhe7jfbchoyed7y7qasozm

Regret minimization and the price of total anarchy

Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth
2008 Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08  
In contrast to the price of anarchy and the recently introduced price of sinking [15] , which require all players to behave in a prescribed manner, we show that the price of total anarchy is in many cases  ...  hard to find), we assume only that selfish players play so as to minimize their own regret.  ...  The results in Section 5.1, however, imply a price of total anarchy ≤ 2.5 for the load balancing game with the sum social utility function (since load balancing is a special case of routing), even for  ... 
doi:10.1145/1374376.1374430 dblp:conf/stoc/BlumHLR08 fatcat:xzady5qopjdu5eowujahhcklzu

Selfish Load Balancing and Atomic Congestion Games

Subhash Suri, Csaba D. Toth, Yunhong Zhou
2006 Algorithmica  
We revisit a classical load balancing problem in the modern context of decentralized systems and self-interested clients.  ...  This interaction is naturally modeled as an atomic congestion game, which we call selfish load balancing.  ...  In this paper we give nearly tight bounds for the price of anarchy in the selfish load balancing game.  ... 
doi:10.1007/s00453-006-1211-4 fatcat:wl257h246zfjlbyfsszrc2j7ym

Behavioral learning game for socio-physical IoT connections

Sungwook Kim
2016 EURASIP Journal on Wireless Communications and Networking  
The main contribution of our work lies in the fact that we shed some new light on the interplay between the game player's selfishness and the public interest.  ...  Finally, we study how to effectively negotiate between players who, though interested in their own welfare, are also willing to consider other players in the IoT system.  ...  In addition, we draw on the concept of selfishness and social welfare trade-offs.  ... 
doi:10.1186/s13638-016-0521-8 fatcat:kos3hzs6srhi3mdwqsyorqgyhu

Congestion Games, Load Balancing, and Price of Anarchy [chapter]

Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
2005 Lecture Notes in Computer Science  
In this overview paper, we summarize results of our ongoing work on the analysis of the server matching game, and suggest some promising directions for future research.  ...  Many emerging Internet-centric applications such as peer-to-peer networks, multi-player online games and distributed computing platforms exhibit such interaction of self-interested users.  ...  Our problem is related to a classical (coordinated) version of load balancing problem [2] , however, the lack of coordination and selfish clients add a new twist to that problem.  ... 
doi:10.1007/11527954_3 fatcat:ghf2d4uwure7lfthtrqgytl6g4

Selfish routing and wavelength assignment strategies with advance reservation in inter-domain optical networks

Francesco Palmieri, Ugo Fiore, Sergio Ricciardi
2012 Computer Communications  
interacting in a distributed manner and aiming at maximizing their own welfare.  ...  On this concept, we developed a selfish adaptive RWA model supporting advance reservation in large-scale optical wavelength-routed networks and developed a distributed algorithm to compute approximate  ...  Acknowledgments This work was supported in part by the COST Action  ... 
doi:10.1016/j.comcom.2011.10.010 fatcat:rcxlygpifjhgbb4yrxqbiw6zba

Coordination mechanisms for decentralized parallel systems

Johanne Cohen, Daniel Cordeiro, Denis Trystram
2014 Concurrency and Computation  
The main contribution is to show (in theory and practice) how to devise pure Nash equilibria configurations for every instance of the problem and to prove that the price payed by the collectivity depends  ...  We study the price that the collectivity must pay in order to allow independence to selfish, self-governing organizations, so they can choose the best schedules for their own jobs.  ...  selfish load balancing problems).  ... 
doi:10.1002/cpe.3298 fatcat:ybxpz4haizbxbec2z3pgbpvebq

Centralized Blockchain-Based Energy Trading Platform for Interconnected Microgrids

Mohamed R. Hamouda, Mohammed E. Nassar, M. M. A. Salama
2021 IEEE Access  
Inter-connected Microgrids (IMGs) have emerged as a promising structure for future grids, offering resilience and independence in energy exchangeability with neighbours.  ...  In this paper, a new strategy is proposed for IMG energy trading that considers SBD actions for MGs' agents, and a unique utility function for each MG is defined.  ...  their own internal social welfare.  ... 
doi:10.1109/access.2021.3090213 fatcat:6wuusbntkjdrxlotwdet37rjua

A game-theoretic model for repeated assignment problem between two selfish agents

C G Lennon, J M McGowan, K Y Lin
2008 Journal of the Operational Research Society  
Social Choice Welfare 11: 323-330. Received June 2006; accepted August 2007 after two revisions  ...  The two selfish agents become two players in a two-person non-zero-sum game. We find the Nash equilibrium of this game, and use numerical examples to illustrate the benefit of the token system.  ... 
doi:10.1057/palgrave.jors.2602518 fatcat:ulo2slovjng5tpgwxuyv4fln2u

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

José R. Correa, Maurice Queyranne
2012 Naval Research Logistics  
In contrast, we consider as social cost the total weighted completion time, that is, the sum of the agent costs, a standard definition of welfare in economics.  ...  In the last decade, there has been much progress in understanding scheduling problems in which selfish jobs aim to minimize their individual completion time.  ...  They also thank Christoph and Martín Matamala for stimulating discussions on the material in section 3, and Yossi Azar for pointing out reference [10] .  ... 
doi:10.1002/nav.21497 fatcat:3idnxel5gjcvnoxsyluufd6u3a

Multiplicative updates outperform generic no-regret learning in congestion games

Robert Kleinberg, Georgios Piliouras, Eva Tardos
2009 Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09  
Our results show that natural learning behavior can avoid bad outcomes predicted by the price of anarchy in atomic congestion games such as the load-balancing game introduced by Koutsoupias and Papadimitriou  ...  We study the outcome of natural learning algorithms in atomic congestion games. Atomic congestion games have a wide variety of equilibria often with vastly differing social costs.  ...  Congestion games both with makespan and with social welfare objective function are well understood; see the surveys by Vöcking [38] and Roughgarden [31] .  ... 
doi:10.1145/1536414.1536487 dblp:conf/stoc/KleinbergPT09 fatcat:fi7sizg56jfglao37r5v2432aa

Dynamic Service Placement in Geographically Distributed Clouds

Qi Zhang, Quanyan Zhu, Mohamed Faten Zhani, Raouf Boutaba, Joseph L. Hellerstein
2013 IEEE Journal on Selected Areas in Communications  
in terms of social welfare.  ...  Our analysis suggests that in an uncoordinated scenario where service providers behave in a selfish manner, the resulting Nash equilibrium can be arbitrarily worse than the optimal centralized solution  ...  Our analysis showed that in an uncoordinated scenario where service providers behave in a selfish manner, the resulting NE can be significantly worse than the optimal NE in terms of social welfare.  ... 
doi:10.1109/jsac.2013.sup2.1213008 fatcat:k5nzthaezrd5rihsgbqu3helem

Characterizing Contract-Based Multiagent Resource Allocation in Networks

Bo An, Victor Lesser
2010 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
In addition, socially optimal allocations are always supported by Nash equilibrium and pairwise Nash equilibrium.  ...  In our model, users and nodes in the network make contracts before nodes route traffic for the users.  ...  The authors would also like to thank the editors and the anonymous reviewers for their suggestions for improving the accuracy and readability of this paper.  ... 
doi:10.1109/tsmcb.2009.2035100 pmid:19955040 fatcat:bnyc4244rzak3gfumhewpifm3q
« Previous Showing results 1 — 15 out of 338 results