The following pages link to (Q3549719):
Displaying 32 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- On the performance of mildly greedy players in cut games (Q346481) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← 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)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Competitive routing over time (Q719282) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Congestion games with mixed objectives (Q1631669) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- Equilibrium computation in resource allocation games (Q2149542) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- Dynamic Resource Allocation Games (Q2819456) (← links)
- Computing approximate Nash equilibria in network congestion games (Q2913950) (← links)
- Congestion Games with Mixed Objectives (Q2958352) (← 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 Nash Equilibria in Network Congestion Games (Q3511400) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses (Q5076717) (← links)
- Fast Convergence of Best-Reply Dynamics in Aggregative Games (Q5219297) (← links)
- Congestion Games with Complementarities (Q5283369) (← links)
