Results 31 to 40 of about 4,555 (277)
Selfish traffic allocation for server farms [PDF]
We study the price of selfish routing in noncooperative networks like the Internet. In particular, we investigate the price of selfish routing using the price of anarchy (a.k.a.
Czumaj, Artur +2 more
core +1 more source
Social Welfare and Price of Anarchy in Preemptive Priority Queues [PDF]
Consider an unobservable $M|G|1$ queue with preemptive-resume scheduling and two priority classes. Customers are strategic and may join the premium class for a fee. We analyze the resulting equilibrium outcomes, equilibrium stability, and social welfare.
Jonathan Chamberlain, D. Starobinski
semanticscholar +1 more source
A convergence analysis of the price of anarchy in atomic congestion games [PDF]
We analyze the convergence of the price of anarchy (PoA) of Nash equilibria in atomic congestion games with growing total demand T . When the cost functions are polynomials of the same degree, we obtain explicit rates for a rapid convergence of the PoAs ...
Zijun Wu +3 more
semanticscholar +1 more source
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 +2 more sources
Topological Price of Anarchy bounds for clustering games on networks [PDF]
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
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy [PDF]
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
Wealth Inequality and the Price of Anarchy
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 +4 more sources
The Price of Anarchy for Minsum Related Machine Scheduling [PDF]
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 +4 more
core +1 more source
Price of Anarchy in mmWave Backhaul Routing and Link Scheduling
In this paper we present and evaluate the performance of a routing and link scheduling algorithm for millimeter wave backhaul networks. The proposed algorithm models the access point behavior as being selfish by considering access points always aiming to
D. Triantafyllopoulou +2 more
semanticscholar +1 more source
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions [PDF]
We study the efficiency of first-/second-price sequential multiunit auctions with two buyers and complete information. Extending the primal-dual framework for obtaining efficiency bounds to this sequential setting, we obtain tight price of anarchy bounds.
Mete cSeref Ahunbay, A. Vetta
semanticscholar +1 more source

