scientific article
From MaRDI portal
Publication:2913806
DOI10.4086/toc.2012.v008a006zbMath1283.68414OpenAlexW2150865801MaRDI QIDQ2913806
Elad Hazan, Sanjeev Arora, Satyen Kale
Publication date: 27 September 2012
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2012.v008a006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80)
Related Items
Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals, Replicator dynamics: old and new, Deciding probabilistic automata weak bisimulation: theory and practice, On Learning Algorithms for Nash Equilibria, On incremental approximate saddle-point computation in zero-sum matrix games, Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design, Oracle-Based Robust Optimization via Online Learning, Sublinear time algorithms for approximate semidefinite programming, A poly-log competitive posted-price algorithm for online metrical matching on a spider, Privacy and Truthful Equilibrium Selection for Aggregative Games, Costly circuits, submodular schedules and approximate Carathéodory theorems, Finding Sparse Solutions for Packing and Covering Semidefinite Programs, Hedge algorithm and dual averaging schemes, A multiplicative weights update algorithm for MINLP, Parallel approximation of min-max problems, Solving MIPs via scaling-based augmentation, Approximation and online algorithms for multidimensional bin packing: a survey, Constrained no-regret learning, On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms, Efficient Primal-Dual Graph Algorithms for MapReduce, Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence, Committee polyhedral separability: complexity and polynomial approximation, Optimal anytime regret with two experts, A practitioner’s guide to quantum algorithms for optimisation problems, Convergence of the exponentiated gradient method with Armijo line search, Clarkson's algorithm for violator spaces, A stochastic variant of replicator dynamics in zero-sum games and its invariant measures, Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency, Optimistic optimisation of composite objective with exponentiated update, Online max-min fair allocation, No-regret learning for repeated non-cooperative games with lossy bandits, Geometric distinguishability measures limit quantum channel estimation and discrimination, Optimal partition trees, Log-domain interior-point methods for convex quadratic programming, Algorithms, games, and evolution, Sex with no regrets: how sexual reproduction uses a no regret learning algorithm for evolutionary advantage, Unnamed Item, Mirror descent algorithms for minimizing interacting free energy, Learning Equilibria of a Stochastic Game on Gaussian Interference Channels with Incomplete Information, Dynamics of Bayesian updating with dependent data and misspecified models, Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games, Learning in games with continuous action sets and unknown payoff functions, Bandit-Based Task Assignment for Heterogeneous Crowdsourcing, Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming, Fast approximation of matroid packing and covering, Inferring Sparse Preference Lists from Partial Information, Fractional Set Cover in the Streaming Model., A nearly linear-time PTAS for explicit fractional packing and covering linear programs, Epsilon-net method for optimizations over separable states, Towards more practical linear programming-based techniques for algorithmic mechanism design, On the convergence time of a natural dynamics for linear programming, Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem, Convergence Time of Power-Control Dynamics, A note on fractional coloring and the integrality gap of LP for maximum weight independent set, Q-learning for Markov decision processes with a satisfiability criterion, New error measures and methods for realizing protein graphs from distance data, An SDP primal-dual algorithm for approximating the Lovász-theta function, Bounding the inefficiency of outcomes in generalized second price auctions, Partitioning Well-Clustered Graphs: Spectral Clustering Works!, Near-Optimal Algorithms for Online Matrix Prediction, Unnamed Item, Unnamed Item, Unnamed Item, Correlation clustering in data streams, Near-linear algorithms for geometric hitting sets and set covers, Efficient semidefinite branch-and-cut for MAP-MRF inference, The Geometry of Differential Privacy: The Small Database and Approximate Cases, A Laplacian approach to \(\ell_1\)-norm minimization, Unnamed Item, On the Convergence Time of a Natural Dynamics for Linear Programming, Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs, Unnamed Item, On randomized fictitious play for approximating saddle points over convex sets, Better Bin Packing Approximations via Discrepancy Theory, Packing trees in communication networks, Predictive spreadsheet autocompletion with constraints, Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods, Unnamed Item, Unnamed Item, Multi-Finger Binary Search Trees, How the Experts Algorithm Can Help Solve LPs Online, Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent, Mutation, Sexual Reproduction and Survival in Dynamic Environments, Autobidding with constraints, From Darwin to Poincaré and von Neumann: recurrence and cycles in evolutionary and algorithmic game theory, Family of chaotic maps from game theory, Dynamic Pricing with Multiple Products and Partially Specified Demand Distribution, In Pursuit of the Dynamic Optimality Conjecture, On the Convergence of Mirror Descent beyond Stochastic Convex Programming, Online learning of quantum states, Online Learning of Nash Equilibria in Congestion Games, Dual Space Preconditioning for Gradient Descent, Exponential weight approachability, applications to calibration and regret minimization, Near-Optimal Distributed Maximum Flow, A unifying learning framework for building artificial game-playing agents
Cites Work
