Pages that link to "Item:Q632952"
From MaRDI portal
The following pages link to Convergence to approximate Nash equilibria in congestion games (Q632952):
Displaying 39 items.
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Decentralized dynamics for finite opinion games (Q313975) (← 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)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Competitive routing over time (Q719282) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- On the convergence to Nash equilibrium in problems of distributed computing (Q1614144) (← links)
- Potential games, path independence and Poisson's binomial distribution (Q1616794) (← links)
- Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria (Q1630490) (← links)
- Congestion games with mixed objectives (Q1631669) (← links)
- Congestion games with player-specific payoff functions (Q1915710) (← links)
- Equilibrium computation in resource allocation games (Q2149542) (← links)
- Convergence of incentive-driven dynamics in Fisher markets (Q2155906) (← links)
- On approximate pure Nash equilibria in weighted congestion games with polynomial latencies (Q2221800) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- Heterogeneity and chaos in congestion games (Q2335582) (← links)
- Chaotic congestion games (Q2423058) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions (Q2657274) (← links)
- Approaching equilibrium in parallel (Q2768019) (← links)
- Convergence Dynamics of Graphical Congestion Games (Q2840915) (← links)
- Computing approximate Nash equilibria in network congestion games (Q2913950) (← links)
- Approximate Pure Nash Equilibria in Social Context Congestion Games (Q2937015) (← links)
- Congestion Games with Mixed Objectives (Q2958352) (← links)
- On lookahead equilibria in congestion games (Q2971063) (← links)
- The speed of convergence in congestion games under best-response dynamics (Q3189066) (← links)
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games (Q3449591) (← links)
- (Q4449199) (← links)
- Convergence of Ordered Improvement Paths in Generalized Congestion Games (Q4910934) (← links)
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses (Q5076717) (← links)
- On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies (Q5092336) (← links)
- Fast Convergence of Best-Reply Dynamics in Aggregative Games (Q5219297) (← links)
- Congestion Games with Complementarities (Q5283369) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313021) (← links)
- Nash Equilibrium Problems With Scaled Congestion Costs and Shared Constraints (Q5347786) (← links)
- Atomic Congestion Games: Fast, Myopic and Concurrent (Q5459977) (← links)
- Pure Nash equilibria in restricted budget games (Q5971178) (← links)
