Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time

Keyphrases

• Continuous-time 100%
• Discrete-time 100%
• Atomic Congestion Games 100%
• Mirror Descent 100%
• Nonconvex Potential 100%
• Nonconvex 50%
• No-regret Algorithms 50%
• Multiplicative Updates 50%
• Probability Distribution 25%
• Convergence Analysis 25%
• Gradient Descent 25%
• Regularization Method 25%
• Mirror Descent Algorithm 25%
• Congestion Games 25%
• Convexity 25%
• Separability 25%
• Atomic Flows 25%
• Strategy Profile 25%
• Mixed Strategy 25%
• Convex Potentials 25%
• Class-specific 25%
• Non-atomic 25%
• Replicator Dynamics 25%
• Congestion Management Market 25%

Mathematics

• Discrete Time 100%
• Continuous Time 100%
• Potential Function 100%
• Congestion Game 100%
• Multiplicative 40%
• Regularization 20%
• Probability Distribution 20%
• Convergence Analysis 20%
• Mixed Strategy 20%
• Replicator 20%

Computer Science

• Continuous Time 100%
• discrete-time 100%
• Potential Function 100%
• Multiplicative Update 40%
• Approximation (Algorithm) 20%
• Mathematical Convergence 20%
• Gradient Descent 20%
• Strategy Profile 20%
• Regularization Function 20%