Pages that link to "Item:Q5449812"
From MaRDI portal
The following pages link to Convergence and Approximation in Potential Games (Q5449812):
Displaying 17 items.
- Convergence and approximation in potential games (Q441854) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Graphical congestion games (Q639291) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Dynamics in network interaction games (Q1938382) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Computing Stable Outcomes in Hedonic Games (Q3162517) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- Atomic Congestion Games: Fast, Myopic and Concurrent (Q5459977) (← links)
