Pages that link to "Item:Q1818286"
From MaRDI portal
The following pages link to Adaptive game playing using multiplicative weights (Q1818286):
Displayed 50 items.
- On incremental approximate saddle-point computation in zero-sum matrix games (Q286267) (← links)
- Generalized mirror descents in congestion games (Q334813) (← links)
- Note on universal conditional consistency (Q532666) (← links)
- Proportional response dynamics in the Fisher market (Q541676) (← links)
- Load balancing without regret in the bulletin board model (Q661046) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Efficient learning equilibrium (Q814627) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Regret minimization in repeated matrix games with variable stage duration (Q926893) (← links)
- Exponential weight algorithm in continuous time (Q959954) (← links)
- A payoff-based learning procedure and its application to traffic games (Q993787) (← links)
- Effective short-term opponent exploitation in simplified poker (Q1009317) (← links)
- Perspectives on multiagent learning (Q1028921) (← links)
- No regrets about no-regret (Q1028930) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Belief-based equilibrium (Q1885429) (← links)
- Regret bounds for sleeping experts and bandits (Q1959599) (← links)
- Bayesian adversarial multi-node bandit for optimal smart grid protection against cyber attacks (Q2021298) (← links)
- Multi-agent reinforcement learning: a selective overview of theories and algorithms (Q2094040) (← links)
- Constrained no-regret learning (Q2178579) (← links)
- Opinion dynamics with limited information (Q2190406) (← links)
- Fictitious play in networks (Q2206807) (← links)
- Tatonnement beyond gross substitutes? Gradient descent to the rescue (Q2206817) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- On the stability of an adaptive learning dynamics in traffic games (Q2319665) (← links)
- Equilibrium routing under uncertainty (Q2349119) (← links)
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents (Q2384141) (← links)
- Dynamic benchmark targeting (Q2397633) (← links)
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
- Deterministic calibration and Nash equilibrium (Q2462508) (← links)
- Linear programming with online learning (Q2465950) (← links)
- Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
- Multi-armed bandits based on a variant of simulated annealing (Q2520136) (← links)
- Zero-Sum Polymatrix Games: A Generalization of Minmax (Q2806824) (← links)
- Learning in Games via Reinforcement and Regularization (Q2833105) (← links)
- An Adjusted Payoff-Based Procedure for Normal Form Games (Q2833112) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Gambling, Computational Information and Encryption Security (Q2947527) (← links)
- A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs (Q2971158) (← links)
- On Learning Algorithms for Nash Equilibria (Q3162512) (← links)
- Competitive On-line Statistics (Q4831997) (← links)
- (Q5020878) (← links)
- Network Inspection for Detecting Strategic Attacks (Q5080657) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Online Learning of Nash Equilibria in Congestion Games (Q5252509) (← links)
- A general class of adaptive strategies (Q5938632) (← links)
- Opinion dynamics with limited information (Q6088303) (← links)
- A stochastic variant of replicator dynamics in zero-sum games and its invariant measures (Q6090682) (← links)
- No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)