Pages that link to "Item:Q2913950"
From MaRDI portal
The following pages link to Computing approximate Nash equilibria in network congestion games (Q2913950):
Displaying 8 items.
- Representation of finite games as network congestion games (Q378323) (← links)
- Nonlinear game models for large-scale network bandwidth management (Q1027141) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- On approximate Nash equilibria in network design (Q2808835) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (Q3586381) (← links)
- Network spot‐checking games: Theory and application to toll enforcing in transportation networks (Q4565763) (← links)