On the computation of equilibria in monotone and potential stochastic hierarchical games

Keyphrases

• Monotone 100%
• Equilibrium Computation 100%
• Implicit Form 75%
• Variance-reduced 75%
• Convergence Rate 50%
• Best Response 50%
• Mathematical Program with Equilibrium Constraints 50%
• Strongly Monotone 50%
• Strongly Convex 50%
• Approximate Nash Equilibrium 50%
• Stochastic Mathematical Program with Equilibrium Constraints 50%
• Game Strategy 25%
• Monotonicity Assumptions 25%
• Nash Equilibrium 25%
• Accuracy Improvement 25%
• Fast Rates 25%
• Parametrized 25%
• Approximate Solution 25%
• Problem Size 25%
• Equilibrium Condition 25%
• Efficient Computation 25%
• Nonoperative 25%
• Near-optimal 25%
• Computational Scheme 25%
• Zeroth-order 25%
• Point Scheme 25%
• Proximal Point 25%
• Response Framework 25%
• Almost Sure 25%
• N-person Game 25%
• Complexity Guarantees 25%
• Optimal Sample 25%
• Implicit Problem 25%
• Stochastic Inclusion 25%
• Stochastic Proximal Point 25%
• Almost Surely 25%
• Sample Complexity 25%

Mathematics

• Stochastics 100%
• Mathematical Program 80%
• Equilibrium Constraint 80%
• Convex 80%
• Nash Equilibrium 60%
• Variance 60%
• Implicit Form 60%
• Approximates 40%
• Strongly Monotone 40%
• Rate of Convergence 40%
• Numerical Analysis 20%
• Approximate Solution 20%
• Finite Time 20%
• Point Scheme 20%
• Potential Function 20%