default search action
Mathematics of Operations Research, Volume 44
Volume 44, Number 1, February 2019
- Javier Peña
, Daniel Rodríguez:
Polytope Conditioning and Linear Convergence of the Frank-Wolfe Algorithm. 1-18 - Yongchao Liu
Discrete Approximation and Quantification in Distributionally Robust Optimization. 19-37 - Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses
Risk-Averse Selfish Routing. 38-57 - Nabil Kahalé
Efficient Simulation of High Dimensional Gaussian Vectors. 58-73 - Antônio Francisco Neto
Generating Functions of Weighted Voting Games, MacMahon's Partition Analysis, and Clifford Algebras. 74-101 - Alexander Schied
A Market Impact Game Under Transient Price Impact. 102-121 - Boris G. Pittel
On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women. 122-146 - Abbas Bazzi
No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ. 147-172 - Yun-Bin Zhao
Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction. 173-195 - Paul Dütting
Expressiveness and Robustness of First-Price Position Auctions. 196-211 - Gaëtan Fournier
Location Games on Networks: Existence and Efficiency of Equilibria. 212-235 - Alfredo N. Iusem, Alejandro Jofré, Philip Thompson
Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities. 236-263 - Sébastien Bubeck, Ronen Eldan
The Entropic Barrier: Exponential Families, Log-Concave Geometry, and Self-Concordance. 264-276 - Fabien Gensbittel
Zero-Sum Stopping Games with Asymmetric Information. 277-302 - Kenichiro Shiraya
Pricing Average and Spread Options Under Local-Stochastic Volatility Jump-Diffusion Models. 303-333 - Wanmo Kang
Unbiased Sensitivity Estimation of One-Dimensional Diffusion Processes. 334-353 - Jian Li
Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 354-375
Volume 44, Number 2, May 2019
- Aurélien Garivier, Pierre Ménard, Gilles Stoltz
Explore First, Exploit Next: The True Shape of Regret in Bandit Problems. 377-399 - Daniel Lacker
Rare Nash Equilibria and the Price of Anarchy in Large Static Games. 400-422 - Thomas Kruse, Philipp Strack
An Inverse Optimal Stopping Problem for Diffusion Processes. 423-439 - Romuald Elie, Thibaut Mastrolia, Dylan Possamaï
A Tale of a Principal and Many, Many Agents. 440-467 - Erhan Bayraktar
No-Arbitrage and Hedging with Liquid American Options. 468-486 - Ali Aouad
Approximation Algorithms for Dynamic Assortment Optimization Models. 487-511 - Tiziano De Angelis
A Solvable Two-Dimensional Degenerate Singular Stochastic Control Problem with Nonconvex Costs. 512-531 - Erhun Özkan
On the Control of Fork-Join Networks. 532-564 - Jose H. Blanchet
Quantifying Distributional Model Risk via Optimal Transport. 565-600 - Qi (George) Chen
Nonparametric Self-Adjusting Control for Joint Learning and Optimization of Multiproduct Pricing with Finite Resource Capacity. 601-631 - Ya-Feng Liu
On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming. 632-650 - Peter I. Frazier, Shane G. Henderson
Probabilistic Bisection Converges Almost as Quickly as Stochastic Approximation. 651-667 - Wang Chi Cheung
Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models. 668-692 - Jose H. Blanchet
Perfect Sampling of Generalized Jackson Networks. 693-714 - Minh N. Dao
Linear Convergence of Projection Algorithms. 715-738 - Asaf Cohen
Brownian Control Problems for a Multiclass M/M/1 Queueing Problem with Model Uncertainty. 739-766
Volume 44, Number 3, August 2019
- Ori Haimanko
The Banzhaf Value and General Semivalues for Differentiable Mixed Games. 767-782 - Vincent Conitzer
The Exact Computational Complexity of Evolutionarily Stable Strategies. 783-792 - Joey Huchette
A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints. 793-820 - Gianmarco Bet
Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations. 821-864 - Omer Ben-Porat
Multiunit Facility Location Games. 865-889 - Kyomin Jung, Yingdong Lu
Revisiting Stochastic Loss Networks: Structures and Approximations. 890-918 - Bohan Chen
Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes. 919-942 - Zhen Xu
Instantaneous Control of Brownian Motion with a Positive Lead Time. 943-965 - Jakub Trybula
Continuous-Time Portfolio Choice Under Monotone Mean-Variance Preferences - Stochastic Factor Case. 966-987 - Niv Buchbinder
Constrained Submodular Maximization via a Nonsymmetric Technique. 988-1005 - Naci Saldi
Approximate Nash Equilibria in Partially Observed Stochastic Games with Mean-Field Interactions. 1006-1033 - Matteo Burzoni
Pointwise Arbitrage Pricing Theory in Discrete Time. 1034-1057 - Saeed Alaei
Efficient Computation of Optimal Auctions via Reduced Forms. 1058-1086 - Jinyan Fan, Jiawang Nie
Completely Positive Binary Tensors. 1087-1100 - Martin Gairing, Rahul Savani
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games. 1101-1121 - Desmond W. H. Cai, Subhonmesh Bose, Adam Wierman:
On the Role of a Market Maker in Networked Cournot Competition. 1122-1144
Volume 44, Number 4, November 2019
- Mark E. Lewis
Uniform Turnpike Theorems for Finite Markov Decision Processes. 1145-1160 - James T. Hungerford
A General Regularized Continuous Formulation for the Maximum Clique Problem. 1161-1173 - Massimo Marinacci
Unique Tarski Fixed Points. 1174-1191 - Amir Ali Ahmadi
On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity. 1192-1207 - Amitabh Basu
Optimal Cutting Planes from the Group Relaxations. 1208-1220 - Simon Bruggmann
Submodular Maximization Through the Lens of Linear Programming. 1221-1244 - Marcel Nutz
A Mean Field Competition. 1245-1263 - Amitabh Basu
Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. 1264-1285 - José Correa
The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing. 1286-1303 - AmirMahdi Ahmadinejad, Sina Dehghani
From Duels to Battlefields: Computing Equilibria of Blotto and Other Games. 1304-1325 - Takashi Kunimoto
Rationalizable Implementation of Correspondences. 1326-1344 - Mor Armony
Asymptotically Optimal Appointment Schedules. 1345-1380 - Tien-Son Pham
Optimality Conditions for Minimizers at Infinity in Polynomial Programming. 1381-1395 - Ngoc Mai Tran
Product-Mix Auctions and Tropical Geometry. 1396-1411 - Amitabh Basu
The Structure of the Infinite Models in Integer Programming. 1412-1430 - Robbert Fokkink, Thomas Lidbetter
On Submodular Search and Machine Scheduling. 1431-1449 - Vasilis Syrgkanis
Information Asymmetries in Common-Value Auctions with Discrete Signals. 1450-1476 - Jean B. Lasserre
Semidefinite Relaxations for Lebesgue and Gaussian Measures of Unions of Basic Semialgebraic Sets. 1477-1493 - Alfonso Cevallos
An Improved Analysis of Local Search for Max-Sum Diversification. 1494-1509
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: