Math. Oper. Res

457 papers375 directions

Papers by Year

2026 24
2025 25
2024 40
2023 41
2022 44
2021 37
2020 35
2019 38
2018 28
2017 32
2016 28
2015 22
2014 22
2013 11
2012 8
2011 10
2010 13
2009 16
2008 8
2007 8
2006 9
2005 7
2004 5
2003 3
2002 4
2000 2
1999 4
1998 1
1997 3
1996 1
1995 2
1994 2
1993 3
1992 3
1991 2
1988 1
1987 1

Top Research Directions

Research directions most represented by papers from this venue.

Overcoming the Convexity Constraint in Modern Optimization 13
The Empirical Validation Gap 12
From Fractional Solutions to Discrete Decisions 7
Aligning Selfish Routing with Socially Optimal Traffic Flow 6
Strategyproof Resource Allocation Without Money 5
Optimization over Non-Smooth and Non-Convex Landscapes 5
Analyzing Systems with Non Exponential Service Times 4
Symmetry Reduction for High Dimensional Optimization 4
Overcoming the Static Pricing Assumption 4
Convergence Guarantees for Inexact Subproblem Optimization 4
Tractable Convex Reformulations for Robust Optimization 4
Scaling Bandit Learning to Large Action Spaces 4
Multi-Agent Learning Under Bandit Feedback 4
Convergence Rates of Mean Field Approximations 4
Calibrating Uncertainty Set Radii for Robust Optimization 4

Top Authors

AuthorPapers
Maxim Sviridenko12
Jose Correa11
Anupam Gupta8
Jean B. Lasserre8
Shie Mannor8
Viswanath Nagarajan8
Jerome Bolte7
László A. Végh7
Roberto Cominetti7
Asuman E. Ozdaglar6
Christos Papadimitriou6
David Gamarnik6
Max Klimm6
Niv Buchbinder6
Adam Wierman5
Amin Saberi5
Marco Molinaro5
Moshe Tennenholtz5
Alberto Del Pia4
Anthony Man-Cho So4

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games2020
On the Construction of Substitutes2020
On the Efficiency of Random Permutation for ADMM and Coordinate Descent2020
Rates of Convergence to Stationarity for Reflected Brownian Motion2020
Reinforcement with Fading Memories2020
Rescaling Algorithms for Linear Conic Feasibility2020
Stochastic Recursive Inclusions in Two Timescales with Nonadditive Iterate-Dependent Markov Noise2020
A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints.2019
A General Regularized Continuous Formulation for the Maximum Clique Problem2019
A Mean Field Competition2019
Approximate Nash Equilibria in Partially Observed Stochastic Games with Mean-Field Interactions2019
Asymptotically Optimal Appointment Schedules2019
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games2019
Constrained Submodular Maximization via a Nonsymmetric Technique2019
Efficient Computation of Optimal Auctions via Reduced Forms2019
Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes2019
Explore First, Exploit Next: The True Shape of Regret in Bandit Problems2019
Expressiveness and Robustness of First-Price Position Auctions2019
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games2019
Information Asymmetries in Common-Value Auctions with Discrete Signals2019
Instantaneous Control of Brownian Motion with a Positive Lead Time2019
Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems2019
Multiunit Facility Location Games2019
No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ2019
On Submodular Search and Machine Scheduling2019
On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming2019
On the Role of a Market Maker in Networked Cournot Competition2019
Perfect Sampling of Generalized Jackson Networks2019
Pointwise Arbitrage Pricing Theory in Discrete Time2019
Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation2019
Quantifying Distributional Model Risk via Optimal Transport2019
Revisiting Stochastic Loss Networks: Structures and Approximations2019
Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models2019
Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets2019
The Entropic Barrier: Exponential Families, Log-Concave Geometry, and Self-Concordance2019
The Exact Computational Complexity of Evolutionarily Stable Strategies2019
The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing2019
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs2018
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem2018
A Single-Phase, Proximal Path-Following Framework2018
Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank2018
Chebyshev Inequalities for Products of Random Variables2018
Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence2018
Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms2018
Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics2018
Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence2018
On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation2018
Optimal Transport Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes2018
Reversibility and Further Properties of FCFS Infinite Bipartite Matching2018
Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures2018

« prev Page 5/10 next »