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