Tight bounds for worst-case equilibria
From MaRDI portal
Publication:2944540
DOI10.1145/1186810.1186814zbMath1322.91017OpenAlexW1966132455MaRDI QIDQ2944540
Berthold Vöcking, Artur Czumaj
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1186810.1186814
Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80)
Related Items
Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ The complexity of welfare maximization in congestion games ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Efficiency analysis with respect to the unit cost objectives in scheduling games ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Reducing price of anarchy of selfish task allocation with more selfishness ⋮ On the second point-to-point undirected shortest simple path problem ⋮ Multi-round cooperative search games with multiple players ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Smoothed performance guarantees for local search ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Selfish bin coloring ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Inefficiency of equilibria for scheduling game with machine activation costs ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ The price of anarchy on uniformly related machines revisited ⋮ Scheduling games with rank-based utilities ⋮ The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Performance guarantees of jump neighborhoods on restricted related parallel machines ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Selfish Bin Packing ⋮ Scheduling games with machine-dependent priority lists ⋮ Performance guarantees for scheduling algorithms under perturbed machine speeds ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ A new model for selfish routing ⋮ Selfish routing with incomplete information ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Extending the notion of rationality of selfish agents: second order Nash equilibria ⋮ The cost of selfishness for maximizing the minimum load on uniformly related machines ⋮ Unnamed Item ⋮ Multistage interval scheduling games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Load rebalancing games in dynamic systems with migration costs ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ The Price of Anarchy on Uniformly Related Machines Revisited ⋮ Selfish load balancing for jobs with favorite machines ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines ⋮ On the sequential price of anarchy of isolation games ⋮ Parametric packing of selfish items and the subset sum algorithm
