Pages that link to "Item:Q3507775"
From MaRDI portal
The following pages link to Algorithms for pure Nash equilibria in weighted congestion games (Q3507775):
Displaying 19 items.
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- Computing pure Nash equilibria in network revenue management games (Q1656431) (← links)
- A unifying approximate potential for weighted congestion games (Q2109950) (← links)
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies (Q2221800) (← links)
- Congestion games with variable demands (Q2800374) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (Q3586381) (← links)
- Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions (Q4557738) (← links)
- (Q5002835) (← links)
- Pure Nash Equilibria in Resource Graph Games (Q5026179) (← links)
- The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
- Experimental and Efficient Algorithms (Q5710018) (← links)
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games (Q5870354) (← links)
- On the existence of pure Nash equilibria in weighted congestion games (Q5891841) (← links)
- Nash equilibria in two-resource congestion games with player-specific payoff functions (Q6555679) (← links)
