scientific article; zbMATH DE number 2119691
From MaRDI portal
Publication:4828962
Recommendations
Cited in
(57)- A coordination mechanism for a scheduling game with uniform-batching machines
- Selfish bin packing
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- Approximate equilibria and ball fusion
- Inefficiency of equilibria for the machine covering game on uniform machines
- Utilitarian resource assignment
- Worst-case Nash equilibria in restricted routing
- Connectivity and equilibrium in random games
- Coordination mechanisms
- Optimal coordination mechanisms for unrelated machine scheduling
- Strong stability of Nash equilibria in load balancing games
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- Scheduling to Maximize Participation
- Equilibria for networks with malicious users
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- The Influence of Link Restrictions on (Random) Selfish Routing
- Atomic routing games on maximum congestion
- Non-clairvoyant scheduling games
- Tradeoffs in worst-case equilibria
- Efficient graph topologies in network routing games
- Nonpreemptive coordination mechanisms for identical machines
- Nonadaptive Selfish Routing with Online Demands
- Towards a General Theory of Good-Deal Bounds*
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands
- Selfish unsplittable flows
- The price of anarchy for polynomial social cost
- Approximation and Online Algorithms
- How hard is it to find extreme Nash equilibria in network congestion games?
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Game-theoretic analysis of Internet switching with selfish users
- How to find Nash equilibria with extreme total latency in network congestion games?
- Tight bounds for worst-case equilibria
- Two-group knapsack game
- Strong equilibrium in cost sharing connection games
- Tight bounds for selfish and greedy load balancing
- Approximate Strong Equilibrium in Job Scheduling Games
- Coordination mechanisms for parallel machine scheduling
- On the structure and complexity of worst-case equilibria
- Efficiency analysis of load balancing games with and without activation costs
- Coordination mechanisms for selfish scheduling
- Mixed Nash equilibria in selfish routing problems with dynamic constraints
- Scheduling to maximize participation
- Load balancing without regret in the bulletin board model
- Inefficiency of Nash equilibria with parallel processing policy
- Strong price of anarchy
- Structure and complexity of extreme Nash equilibria
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- The price of anarchy is independent of the network topology
- On the complexity of constrained Nash equilibria in graphical games
- A network pricing game for selfish traffic
- Price of anarchy in parallel processing
- Worst-case equilibria
- The price of matching with metric preferences
- Subjective vs. Objective Reality — The Risk of Running Late
- Nonatomic non-cooperative neighbourhood balancing games
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)
