Pages that link to "Item:Q644806"
From MaRDI portal
The following pages link to Tight bounds for selfish and greedy load balancing (Q644806):
Displaying 32 items.
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Social context congestion games (Q386894) (← links)
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies (Q2221800) (← links)
- Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- On Stackelberg strategies in affine congestion games (Q2322708) (← links)
- Some anomalies of farsighted strategic behavior (Q2344212) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- (Q3301024) (← links)
- On Stackelberg Strategies in Affine Congestion Games (Q3460782) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- (Q5002835) (← links)
- The Price of Stability of Weighted Congestion Games (Q5002839) (← links)
- On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies (Q5092336) (← links)
- (Q5111703) (← links)
- The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
- Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
- Congestion games with priority-based scheduling (Q6049927) (← links)
- Price of anarchy for parallel link networks with generalized mean objective (Q6103184) (← links)
- Scheduling games with rank-based utilities (Q6160122) (← links)
