scientific article; zbMATH DE number 2119691
From MaRDI portal
Publication:4828962
zbMath1092.91508MaRDI QIDQ4828962
Berthold Vöcking, Artur Czumaj
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (53)
The shortest first coordination mechanism for a scheduling game with parallel-batching machines ⋮ Strong equilibrium in cost sharing connection games ⋮ On the complexity of constrained Nash equilibria in graphical games ⋮ Coordination mechanisms ⋮ Atomic routing games on maximum congestion ⋮ Optimal Coordination Mechanisms for Unrelated Machine Scheduling ⋮ The Price of Matching with Metric Preferences ⋮ Worst-case Nash equilibria in restricted routing ⋮ On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands ⋮ The price of anarchy for polynomial social cost ⋮ Utilitarian resource assignment ⋮ Nonpreemptive coordination mechanisms for identical machines ⋮ Anarchy Is Free in Network Creation ⋮ On the structure and complexity of worst-case equilibria ⋮ Coordination mechanisms for parallel machine scheduling ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ A network pricing game for selfish traffic ⋮ Tight bounds for selfish and greedy load balancing ⋮ Non-clairvoyant scheduling games ⋮ Inefficiency of Nash equilibria with parallel processing policy ⋮ Worst-case equilibria ⋮ Strong stability of Nash equilibria in load balancing games ⋮ Load balancing without regret in the bulletin board model ⋮ Scheduling to maximize participation ⋮ The toll effect on price of anarchy when costs are nonlinear and asymmetric ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ Selfish bin packing ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Connectivity and equilibrium in random games ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Two-group knapsack game ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Game-theoretic analysis of Internet switching with selfish users ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ Equilibria for networks with malicious users ⋮ Tradeoffs in worst-case equilibria ⋮ Price of anarchy in parallel processing ⋮ Scheduling to Maximize Participation ⋮ A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines ⋮ The price of anarchy is independent of the network topology ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ Subjective vs. Objective Reality — The Risk of Running Late ⋮ Strong price of anarchy ⋮ Coordination mechanisms for selfish scheduling ⋮ Efficient graph topologies in network routing games ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Structure and complexity of extreme Nash equilibria ⋮ Selfish unsplittable flows
This page was built for publication:
