Pages that link to "Item:Q2913806"
From MaRDI portal
The following pages link to The multiplicative weights update method: a meta-algorithm and applications (Q2913806):
Displaying 50 items.
- Algorithms, games, and evolution (Q2962243) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- Convergence Time of Power-Control Dynamics (Q3012955) (← links)
- On Learning Algorithms for Nash Equilibria (Q3162512) (← links)
- Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods (Q3386436) (← links)
- Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design (Q3449585) (← links)
- Oracle-Based Robust Optimization via Online Learning (Q3450465) (← links)
- Privacy and Truthful Equilibrium Selection for Aggregative Games (Q3460796) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information (Q4607282) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Mutation, Sexual Reproduction and Survival in Dynamic Environments (Q4638065) (← links)
- Family of chaotic maps from game theory (Q4994902) (← links)
- Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
- Finding Sparse Solutions for Packing and Covering Semidefinite Programs (Q5071107) (← links)
- Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs (Q5075785) (← links)
- (Q5077149) (← links)
- (Q5089186) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- (Q5091176) (← links)
- Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency (Q5106381) (← links)
- (Q5111734) (← links)
- (Q5116489) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- On the Convergence Time of a Natural Dynamics for Linear Programming (Q5136233) (← links)
- Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
- Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals (Q5214272) (← links)
- Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution (Q5244873) (← links)
- Online Learning of Nash Equilibria in Congestion Games (Q5252509) (← links)
- Bandit-Based Task Assignment for Heterogeneous Crowdsourcing (Q5380349) (← links)
- (Q5381115) (← links)
- (Q5381119) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- Near-Optimal Algorithms for Online Matrix Prediction (Q5737809) (← links)
- On the Convergence of Mirror Descent beyond Stochastic Convex Programming (Q5853716) (← links)
- Online learning of quantum states (Q5854122) (← links)
- Dual Space Preconditioning for Gradient Descent (Q5857297) (← links)
- Subtrajectory clustering: finding set covers for set systems of subcurves (Q5881551) (← links)
- Optimal anytime regret with two experts (Q6062702) (← links)
- A practitioner’s guide to quantum algorithms for optimisation problems (Q6063352) (← links)
- A stochastic variant of replicator dynamics in zero-sum games and its invariant measures (Q6090682) (← links)
- Optimistic optimisation of composite objective with exponentiated update (Q6097136) (← links)
- No-regret learning for repeated non-cooperative games with lossy bandits (Q6152576) (← links)
- Log-domain interior-point methods for convex quadratic programming (Q6164958) (← links)
- Distributed dense subgraph detection and low outdegree orientation (Q6535012) (← links)
- Solving maxmin optimization problems via population games (Q6536843) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
- A natural adaptive process for collective decision-making (Q6565779) (← links)
- An improved deterministic algorithm for the online min-sum set cover problem (Q6574926) (← links)