Pages that link to "Item:Q1717237"
From MaRDI portal
The following pages link to Learning in games with continuous action sets and unknown payoff functions (Q1717237):
Displaying 38 items.
- Hedging under uncertainty: regret minimization meets exponentially fast convergence (Q681880) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- Stochastic mirror descent dynamics and their convergence in monotone variational inequalities (Q1626529) (← links)
- Variance-based subgradient extragradient method for stochastic variational inequality problems (Q2050568) (← links)
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems (Q2095329) (← links)
- Learning in nonatomic games. I: Finite action spaces and population games (Q2106066) (← links)
- On the robustness of learning in games with stochastically perturbed payoff observations (Q2357809) (← links)
- Learning payoff functions in infinite games (Q2384147) (← links)
- Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
- On Minty-variational inequalities and evolutionary stable states of generalized monotone games (Q2661597) (← links)
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games (Q2680260) (← links)
- Learning in mean field games: The fictitious play (Q2968798) (← links)
- Mixed-Strategy Learning With Continuous Action Sets (Q2979292) (← links)
- Bush‐Mosteller learning for a zero-sum repeated game with random pay-offs (Q3152487) (← links)
- On the Convergence of Gradient-Like Flows with Noisy Gradient Input (Q4602552) (← links)
- Independent Log-Linear Learning in Potential Games With Continuous Actions (Q4630114) (← links)
- (Q4630397) (← links)
- Robust Power Management via Learning and Game Design (Q4994161) (← links)
- On Gradient-Based Learning in Continuous Games (Q5027020) (← links)
- Minibatch Forward-Backward-Forward Methods for Solving Stochastic Variational Inequalities (Q5084485) (← links)
- An Inverse-Adjusted Best Response Algorithm for Nash Equilibria (Q5114400) (← links)
- Variance-Based Modified Backward-Forward Algorithm with Line Search for Stochastic Variational Inequality Problems and Its Applications (Q5149551) (← links)
- Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
- (Q5381139) (← links)
- On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
- Stochastic Superiority Equilibrium in Game Theory (Q5868929) (← links)
- Learning equilibrium in bilateral bargaining games (Q6096591) (← links)
- Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games (Q6116265) (← links)
- No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
- A unified stochastic approximation framework for learning in games (Q6120942) (← links)
- On the convergence of distributed projected gradient play with heterogeneous learning rates in monotone games (Q6131449) (← links)
- Multi-agent machine learning in self-organizing systems (Q6139451) (← links)
- Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains (Q6150987) (← links)
- Continuous time learning algorithms in optimization and game theory (Q6159505) (← links)
- A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games (Q6192954) (← links)
- The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness (Q6573018) (← links)
- Nested replicator dynamics, nested logit choice, and similarity-based learning (Q6604770) (← links)
- Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
