Results 41 to 50 of about 166,027,039 (183)
Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy [PDF]
, 2017 We consider the well-studied game-theoretic version of machine scheduling in which jobs correspond to self-interested users and machines correspond to resources. Here each user chooses a machine trying to minimize her own cost, and such selfish behavior typically results in some equilibrium which is not globally optimal: An equilibrium is an allocation
Cong Chen 0004, Paolo Penna, Yinfeng Xu
openaire +4 more sources
, 2017 Incorporating budget constraints into the analysis of auctions has become increasingly important, as they model practical settings more accurately. The social welfare function, which is the standard measure of efficiency in auctions, is inadequate for settings with budgets, since there may be a large disconnect between the value a bidder derives from ...
Yossi Azar +3 more
openaire +3 more sources
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy [PDF]
Acta Informatica, 2010 Following recent interest in the "strong price of anarchy" SPOA), we consider this measure, as well as the well known "price of anarchy" (POA) for the job scheduling problem on two uniformly related parallel machines (or links). The atomic players are the jobs, and the delay of a job is the completion time of the machine running it.
openaire +4 more sources
Bargaining Mechanisms for One-Way Games
Games, 2015 We introduce one-way games, a two-player framework whose distinguishable feature is that the private payoff of one (independent) player is determined only by her own strategy and does not depend on the actions taken by the other (dependent) player.
Andrés Abeliuk +2 more
doaj +1 more source
The Price of Anarchy for Minsum Related Machine Scheduling [PDF]
, 2011 We address the classical uniformly related machine scheduling problem with minsum objective. The problem is solvable in polynomial time by the algorithm of Horowitz and Sahni. In that solution, each machine sequences its jobs shortest first. However when
Hoeksma, R.P.; id_orcid +1 more
core +4 more sources
Wealth Inequality and the Price of Anarchy
CoRR, 2018 Price of anarchy quantifies the degradation of social welfare in games due to the lack of a centralized authority that can enforce the optimal outcome. At its antipodes, mechanism design studies how to ameliorate these effects by incentivizing socially desirable behavior and implementing the optimal state as equilibrium. In practice, the responsiveness
Gemici, Kurtuluş +4 more
openaire +5 more sources
The Price of Anarchy in Oligopolistic Market Equilibrium: The Two-Sided Supply Chain Network Case [PDF]
E3S Web of ConferencesEquilibrium conditions for the centralized and for the decentralized oligopolistic markets, which can be viewed as a two-sided supply chain network, are defined and determined. Then after, the price of anarchy (PoA) in oligopolistic market is defined and
Hou Heyin
doaj +1 more source
Efficiency analysis of Nash equilibria under parallel processing mechanism(并行加工机制下纳什均衡的效率分析)
Zhejiang Daxue xuebao. Lixue ban, 2014 分析了并行加工机制下同类机排序博弈的纳什均衡的PoA(The Price of Anarchy），证明了混合纳什均衡的PoA为O(log2m），以及纯纳什均衡的PoA为.
WANLong(万龙)
doaj +1 more source
A Game Theoretic Approach to Irregular Repetition Slotted Aloha
IEEE Access, 2022 Many technological enhancements are being developed worldwide to enable the “Internet of Things” (IoT). IoT networks largely rely on distributed access of billions of devices, but are still lagging in terms of combined reliability and low ...
Iman Hmedoush +3 more
doaj +1 more source
Topological Price of Anarchy bounds for clustering games on networks [PDF]
, 2019 We consider clustering games in which the players are embedded in a network and want to coordinate (or anti-coordinate) their choices with their neighbors. Recent studies show that even very basic variants of these games exhibit a large Price of Anarchy.
Kleer, Pieter +7 more
core +2 more sources