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.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- On incremental approximate saddle-point computation in zero-sum matrix games (Q286267) (← links)
- Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
- Parallel approximation of min-max problems (Q354658) (← links)
- Optimal partition trees (Q420575) (← links)
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
- Epsilon-net method for optimizations over separable states (Q496030) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set (Q510956) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Clarkson's algorithm for violator spaces (Q621918) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Autobidding with constraints (Q776226) (← links)
- From Darwin to Poincaré and von Neumann: recurrence and cycles in evolutionary and algorithmic game theory (Q776239) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming (Q931381) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Costly circuits, submodular schedules and approximate Carathéodory theorems (Q1649974) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Sex with no regrets: how sexual reproduction uses a no regret learning algorithm for evolutionary advantage (Q1702267) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
- Fast approximation of matroid packing and covering (Q1730564) (← links)
- Q-learning for Markov decision processes with a satisfiability criterion (Q1749413) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- Dynamics of Bayesian updating with dependent data and misspecified models (Q1952015) (← links)
- On the convergence time of a natural dynamics for linear programming (Q1986962) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
- A poly-log competitive posted-price algorithm for online metrical matching on a spider (Q2140487) (← links)
- Constrained no-regret learning (Q2178579) (← links)
- Mirror descent algorithms for minimizing interacting free energy (Q2204545) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- Bounding the inefficiency of outcomes in generalized second price auctions (Q2253843) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Predictive spreadsheet autocompletion with constraints (Q2303671) (← links)
- Exponential weight approachability, applications to calibration and regret minimization (Q2342741) (← links)
- A unifying learning framework for building artificial game-playing agents (Q2350032) (← links)
- Hedge algorithm and dual averaging schemes (Q2392814) (← links)
- A multiplicative weights update algorithm for MINLP (Q2397756) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Convergence of the exponentiated gradient method with Armijo line search (Q2420800) (← links)
- Geometric distinguishability measures limit quantum channel estimation and discrimination (Q2687122) (← links)
- The geometry of differential privacy: the small database and approximate cases (Q2805515) (← links)
- Better bin packing approximations via discrepancy theory (Q2816297) (← links)
- How the experts algorithm can help solve LPs online (Q2833109) (← links)
- In Pursuit of the Dynamic Optimality Conjecture (Q2848978) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- Efficient Primal-Dual Graph Algorithms for MapReduce (Q2945274) (← links)
