Pages that link to "Item:Q5092336"
From MaRDI portal
The following pages link to On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies (Q5092336):
Displaying 7 items.
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- A unifying approximate potential for weighted congestion games (Q2109950) (← links)
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games (Q3449591) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses (Q5076717) (← links)
- Automata, Languages and Programming (Q5466501) (← links)
- One quarter each (on average) ensures proportionality (Q6609175) (← links)