Content
May 2022, Volume 47, Issue 2
- 1192-1228 Fluid Limits for Multiclass Many-Server Queues with General Reneging Distributions and Head-of-the-Line Scheduling
by Amber L. Puha & Amy R. Ward - 1229-1246 A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods
by Lei Guo & Zhibin Deng - 1247-1265 Multiplayer Bandits Without Observing Collision Information
by Gábor Lugosi & Abbas Mehrabian - 1266-1286 Sufficiency of Markov Policies for Continuous-Time Jump Markov Decision Processes
by Eugene A. Feinberg & Manasa Mandava & Albert N. Shiryaev - 1287-1309 Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution
by José Correa & Paul Dütting & Felix Fischer & Kevin Schewior - 1310-1334 Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources
by Erhun Özkan - 1335-1364 Large Fork-Join Queues with Nearly Deterministic Arrival and Service Times
by Dennis Schol & Maria Vlasiou & Bert Zwart - 1365-1393 The Power of Subsampling in Submodular Maximization
by Christopher Harshaw & Ehsan Kazemi & Moran Feldman & Amin Karbasi - 1394-1411 On the Price of Anarchy for Flows over Time
by José Correa & Andrés Cristi & Tim Oosterwijk - 1412-1442 A Dynamic Contagion Risk Model with Recovery Features
by Hamed Amini & Andreea Minca & Agnès Sulem - 1443-1473 Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems
by Renbo Zhao - 1474-1499 On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs
by Huizhen Yu - 1500-1529 Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes
by Jose Blanchet & Karthyek Murthy & Fan Zhang - 1530-1565 A Case Study on Stochastic Games on Large Graphs in Mean Field and Sparse Regimes
by Daniel Lacker & Agathe Soret - 1566-1611 M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System
by Akiyoshi Shioura - 1612-1630 Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems
by Rohan Ghuge & Viswanath Nagarajan - 1631-1647 The Folk Theorem for Repeated Games with Time-Dependent Discounting
by Daehyun Kim & Xiaoxi Li - 1648-1663 Efficient Allocations in Double Auction Markets
by Teemu Pennanen - 1664-1680 A Randomly Weighted Minimum Arborescence with a Random Cost Constraint
by Alan M. Frieze & Tomasz Tkocz - 1681-1705 Coupled Learning Enabled Stochastic Programming with Endogenous Uncertainty
by Junyi Liu & Guangyu Li & Suvrajeet Sen
February 2022, Volume 47, Issue 1
- 1-28 Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
by Samuel C. Gutekunst & David P. Williamson - 29-49 Optimal Stopping of a Random Sequence with Unknown Distribution
by Alexander Goldenshluger & Assaf Zeevi - 50-71 Computation of Dynamic Equilibria in Series-Parallel Networks
by Marcus Kaiser - 72-99 Hamilton-Jacobi Equations with Semilinear Costs and State Constraints, with Applications to Large Deviations in Games
by William H. Sandholm & Hung V. Tran & Srinivas Arigapudi - 100-119 Finite-Memory Strategies in POMDPs with Long-Run Average Objectives
by Krishnendu Chatterjee & Raimundo Saona & Bruno Ziliotto - 120-152 Mean Field Analysis of Deep Neural Networks
by Justin Sirignano & Konstantinos Spiliopoulos - 153-175 Interactive Information Design
by Frédéric Koessler & Marie Laclau & Tristan Tomala - 176-208 Decomposition of Games: Some Strategic Considerations
by Joseph Abdou & Nikolaos Pnevmatikos & Marco Scarsini & Xavier Venel - 209-231 Graphical Convergence of Subgradients in Nonconvex Optimization and Learning
by Damek Davis & Dmitriy Drusvyatskiy - 232-258 Large Deviations for the Single-Server Queue and the Reneging Paradox
by Rami Atar & Amarjit Budhiraja & Paul Dupuis & Ruoyu Wu - 259-285 Polyhedral Clinching Auctions for Two-Sided Markets
by Hiroshi Hirai & Ryosuke Sato - 286-296 Geometrical Bounds for Variance and Recentered Moments
by Tongseok Lim & Robert J. McCann - 297-319 Intersection Disjunctions for Reverse Convex Sets
by Eli Towle & James Luedtke - 320-340 Value Functions and Optimality Conditions for Nonconvex Variational Problems with an Infinite Horizon in Banach Spaces
by Hélène Frankowska & Nobusumi Sagara - 341-366 Nonzero-Sum Stochastic Games and Mean-Field Games with Impulse Controls
by Matteo Basei & Haoyang Cao & Xin Guo - 367-383 Equilibria Existence in Bayesian Games: Climbing the Countable Borel Equivalence Relation Hierarchy
by Ziv Hellman & Yehuda John Levy - 384-396 Dense Orbits of the Bayesian Updating Group Action
by Ziv Hellman & Yehuda John Levy - 397-426 Variational Analysis of Composite Models with Applications to Continuous Optimization
by Ashkan Mohammadi & Boris S. Mordukhovich & M. Ebrahim Sarabi - 427-457 Quasi-Popular Matchings, Optimality, and Extended Formulations
by Yuri Faenza & Telikepalli Kavitha - 458-484 Probability Distributions on Partially Ordered Sets and Network Interdiction Games
by Mathieu Dahan & Saurabh Amin & Patrick Jaillet - 485-507 Discrete Choice Prox-Functions on the Simplex
by David Müller & Yurii Nesterov & Vladimir Shikhman - 508-539 A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization
by Quoc Tran-Dinh & Ling Liang & Kim-Chuan Toh - 540-559 Regular Matroids Have Polynomial Extension Complexity
by Manuel Aprile & Samuel Fiorini - 560-586 Dynkin Games with Incomplete and Asymmetric Information
by Tiziano De Angelis & Erik Ekström & Kristoffer Glover - 587-615 Mean-Variance Portfolio Selection with Dynamic Targets for Expected Terminal Wealth
by Xue Dong He & Zhaoli Jiang - 616-642 Dynamic Set Values for Nonzero-Sum Games with Multiple Equilibriums
by Zachary Feinstein & Birgit Rudloff & Jianfeng Zhang - 643-664 Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
by Yiannis Giannakopoulos & Georgy Noarov & Andreas S. Schulz - 665-689 Infinite Horizon Stochastic Impulse Control with Delay and Random Coefficients
by Boualem Djehiche & Said Hamadène & Ibtissem Hdhiri & Helmi Zaatra - 690-719 A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization
by Afrooz Jalilzadeh & Angelia Nedić & Uday V. Shanbhag & Farzad Yousefian - 720-749 Mixed-Integer Convex Representability
by Miles Lubin & Juan Pablo Vielma & Ilias Zadik - 750-778 Stochastic Graphon Games: I. The Static Case
by René Carmona & Daniel B. Cooney & Christy V. Graves & Mathieu Laurière - 779-811 Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
by Riley Badenbroek & Etienne de Klerk - 812-846 Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs
by Max Klimm & Philipp Warode
November 2021, Volume 46, Issue 4
- 1235-1249 A General Analysis of Sequential Social Learning
by Itai Arieli & Manuel Mueller-Frank - 1250-1281 A Mean Field Game of Optimal Portfolio Liquidation
by Guanxing Fu & Paulwin Graewe & Ulrich Horst & Alexandre Popier - 1282-1302 Affine Storage and Insurance Risk Models
by Onno Boxma & Michel Mandjes - 1303-1323 Proximal Gradient Methods with Adaptive Subspace Sampling
by Dmitry Grishchenko & Franck Iutzeler & Jérôme Malick - 1324-1348 A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications
by James V. Burke & Hoheisel Tim & Quang V. Nguyen - 1349-1365 Terminal Ranking Games
by Erhan Bayraktar & Yuchong Zhang - 1366-1389 Feasible Bases for a Polytope Related to the Hamilton Cycle Problem
by Thomas Kalinowski & Sogol Mohammadian - 1390-1412 An Optimal High-Order Tensor Method for Convex Optimization
by Bo Jiang & Haoyue Wang & Shuzhong Zhang - 1413-1429 Optimal Monopoly Mechanisms with Demand Uncertainty
by James Peck & Jeevant Rampal - 1430-1451 Extension of Monotonic Functions and Representation of Preferences
by Özgür Evren & Farhad Hüsseinov - 1452-1478 Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals
by José Correa & Patricio Foncea & Ruben Hoeksma & Tim Oosterwijk & Tjark Vredeveld - 1479-1489 On Polyhedral Approximations of the Positive Semidefinite Cone
by Hamza Fawzi - 1490-1512 Distributional Transforms, Probability Distortions, and Their Applications
by Peng Liu & Alexander Schied & Ruodu Wang - 1513-1551 Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
by Łukasz Kruk - 1552-1572 Pure Nash Equilibria and Best-Response Dynamics in Random Games
by Ben Amiet & Andrea Collevecchio & Marco Scarsini & Ziwen Zhong - 1573-1598 Sufficient Optimality Conditions in Bilevel Programming
by Patrick Mehlitz & Alain B. Zemkoho - 1599-1610 Tight Approximation for Unconstrained XOS Maximization
by Yuval Filmus & Yasushi Kawase & Yusuke Kobayashi & Yutaro Yamaguchi - 1611-1638 Stability and Instability of the MaxWeight Policy
by Maury Bramson & Bernardo D’Auria & Neil Walton - 1639-1657 Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models
by Xi Chen & Yining Wang & Yuan Zhou
August 2021, Volume 46, Issue 3
- 835-855 From Monetary to Nonmonetary Mechanism Design via Artificial Currencies
by Artur Gorokh & Siddhartha Banerjee & Krishnamurthy Iyer - 856-868 On Capacity-Filling and Substitutable Choice Rules
by Battal Doğan & Serhat Doğan & Kemal Yıldız - 869-894 Diffusion Approximation for Fair Resource Control—Interchange of Limits Under a Moment Condition
by Heng-Qing Ye & David D. Yao - 895-911 Discrete Dividend Payments in Continuous Time
by Jussi Keppo & A. Max Reppen & H. Mete Soner - 912-945 Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
by Vitaly Feldman & Cristóbal Guzmán & Santosh Vempala - 946-969 Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach
by John C. Duchi & Peter W. Glynn & Hongseok Namkoong - 970-1007 Data Exploration by Representative Region Selection: Axioms and Convergence
by Alexander S. Estes & Michael O. Ball & David J. Lovell - 1008-1037 The Running Intersection Relaxation of the Multilinear Polytope
by Alberto Del Pia & Aida Khajavirad - 1038-1053 Fair Allocation of Indivisible Goods: Improvement
by Mohammad Ghodsi & Mohammad Taghi Hajiaghayi & Masoud Seddighin & Saeed Seddighin & Hadi Yami - 1054-1080 Time-Varying Semidefinite Programs
by Amir Ali Ahmadi & Bachir El Khadir - 1081-1108 Geometric Rescaling Algorithms for Submodular Function Minimization
by Dan Dadush & László A. Végh & Giacomo Zambelli - 1109-1128 A Theory for Measures of Tail Risk
by Fangda Liu & Ruodu Wang - 1129-1148 Universal Barrier Is n -Self-Concordant
by Yin Tat Lee & Man–Chung Yue - 1149-1180 Time-Consistent Conditional Expectation Under Probability Distortion
by Jin Ma & Ting-Kam Leonard Wong & Jianfeng Zhang - 1181-1202 Shapley–Snow Kernels, Multiparameter Eigenvalue Problems, and Stochastic Games
by Luc Attia & Miquel Oliu-Barton - 1203-1229 Intertemporal Choice with Continuity Constraints
by Marcus Pivato - 1230-1234 Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling
by Varun Gupta & Benjamin Moseley & Marc Uetz & Qiaomin Xie
May 2021, Volume 46, Issue 2
- 405-427 Popularity, Mixed Matchings, and Self-Duality
by Chien-Chung Huang & Telikepalli Kavitha - 428-451 Strong and Weak Equilibria for Time-Inconsistent Stochastic Control in Continuous Time
by Yu-Jui Huang & Zhou Zhou - 452-470 Simulation of a Random Variable and its Application to Game Theory
by Mehrdad Valizadeh & Amin Gohari - 471-502 A Probabilistic Approach to Extended Finite State Mean Field Games
by René Carmona & Peiqi Wang - 503-523 The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
by Ioannis Caragiannis & Alexandros A. Voudouris - 524-558 Sensitivity Analysis for the Stationary Distribution of Reflected Brownian Motion in a Convex Polyhedral Cone
by David Lipshutz & Kavita Ramanan - 559-594 ɛ-Strong Simulation of Fractional Brownian Motion and Related Stochastic Differential Equations
by Yi Chen & Jing Dong & Hao Ni - 595-627 Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
by Francisco Facchinei & Vyacheslav Kungurtsev & Lorenzo Lampariello & Gesualdo Scutari - 628-641 Learning Optimal Forecast Aggregation in Partial Evidence Environments
by Yakov Babichenko & Dan Garber - 642-673 Strong Algorithms for the Ordinal Matroid Secretary Problem
by José A. Soto & Abner Turkieltaub & Victor Verdugo - 674-711 On the Optimality of Affine Policies for Budgeted Uncertainty Sets
by Omar El Housni & Vineet Goyal - 712-725 Active‐Set Newton Methods and Partial Smoothness
by Adrian S. Lewis & Calvin Wylie - 726-756 Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand
by Boxiao Chen & Xiuli Chao & Cong Shi - 757-771 Simplex Transformations and the Multiway Cut Problem
by Niv Buchbinder & Roy Schwartz & Baruch Weizman - 772-796 On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime
by Ari Arapostathis & Hassan Hmedi & Guodong Pang - 797-810 Stochastic Comparative Statics in Markov Decision Processes
by Bar Light - 811-833 Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs
by Hans Peters & Souvik Roy & Soumyarup Sadhukhan
February 2021, Volume 46, Issue 1
- 204-220 Efficient Online Linear Optimization with Approximation Algorithms
by Dan Garber - 221-254 Fast Hybrid Schemes for Fractional Riccati Equations (Rough Is Not So Tough)
by Giorgia Callegaro & Martino Grasselli & Gilles Paèes - 255-267 New Algorithms for Solving Zero-Sum Stochastic Games
by Miquel Oliu-Barton - 268-300 Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information
by Rami Atar & David Lipshutz - 301-316 Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
by Immanuel M. Bomze & Michael Kahr & Markus Leitner - 317-335 Algorithms as Mechanisms: The Price of Anarchy of Relax and Round
by Paul Dütting & Thomas Kesselheim & Éva Tardos - 336-360 Infinite-Horizon Optimal Switching Regions for a Pair-Trading Strategy with Quadratic Risk Aversion Considering Simultaneous Multiple Switchings: A Viscosity Solution Approach
by Kiyoshi Suzuki - 361-381 Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization
by Giovanni Paolo Crespi & Andreas H. Hamel & Matteo Rocca & Carola Schrage - 382-403 Competitive Equilibrium with Indivisible Goods and Generic Budgets
by Moshe Babaioff & Noam Nisan & Inbal Talgam-Cohen
August 2020, Volume 45, Issue 3
- 797-832 Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks
by Amarjit Budhiraja & Dane Johnson - 833-861 A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
by Mingyi Hong & Tsung-Hui Chang & Xiangfeng Wang & Meisam Razaviyayn & Shiqian Ma & Zhi-Quan Luo - 862-888 Power-of- d -Choices with Memory: Fluid Limit and Optimality
by Jonatha Anselmi & Francois Dufour - 889-895 Limit Equilibrium Payoffs in Stochastic Games
by Jérôme Renault & Bruno Ziliotto - 896-922 Envy-Free Division of Land
by Erel Segal-Halevi & Shmuel Nitzan & Avinatan Hassidim & Yonatan Aumann - 923-946 General Error Estimates for the Longstaff–Schwartz Least-Squares Monte Carlo Algorithm
by Daniel Z. Zanger - 947-965 Constant Approximation Algorithm for Nonuniform Capacitated Multi-Item Lot Sizing via Strong Covering Inequalities
by Shi Li - 966-992 Variance Regularization in Sequential Bayesian Optimization
by Michael Jong Kim
May 2020, Volume 45, Issue 2
- 403-433 Future Expectations Modeling, Random Coefficient Forward–Backward Stochastic Differential Equations, and Stochastic Viscosity Solutions
by Xanthi-Isidora Kartala & Nikolaos Englezos & Athanasios N. Yannacopoulos - 434-454 Quitting Games and Linear Complementarity Problems
by Eilon Solan & Omri N. Solan - 455-464 Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration
by Hiroshi Hirai & Ryunosuke Oshiro & Ken’ichiro Tanaka - 465-496 A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits
by José Niño-Mora - 497-516 Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling
by Varun Gupta & Benjamin Moseley & Marc Uetz & Qiaomin Xie - 517-546 Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time
by Mengdi Wang - 547-575 Synthesis and Generalization of Structural Results in Inventory Management: A Generalized Convexity Property
by Awi Federgruen & Zhe Liu & Lijian Lu - 576-590 Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
by Alice Paul & Daniel Freund & Aaron Ferber & David B. Shmoys & David P. Williamson - 591-621 Primal–Dual Interior-Point Methods for Domain-Driven Formulations
by Mehdi Karimi & Levent Tunçel - 622-640 The Pareto Comparisons of a Group of Exponential Discounters
by Christopher P. Chambers & Federico Echenique - 641-659 Multiconstrained Finite-Horizon Piecewise Deterministic Markov Decision Processes with Unbounded Transition Rates
by Yonghui Huang & Xianping Guo - 660-681 Rates of Convergence to Stationarity for Reflected Brownian Motion
by Jose Blanchet & Xinyun Chen - 682-712 The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
by Radu Ioan Bot & Dang-Khoa Nguyen - 713-731 Hamiltonian Cycles and Subsets of Discounted Occupational Measures
by Ali Eshragh & Jerzy A. Filar & Thomas Kalinowski & Sogol Mohammadian - 732-754 Rescaling Algorithms for Linear Conic Feasibility
by Daniel Dadush & László A. Végh & Giacomo Zambelli - 755-773 Price of Anarchy in Networks with Heterogeneous Latency Functions
by Sanjiv Kapoor & Junghwan Shin - 774-795 Epi-Regularization of Risk Measures
by Drew P. Kouri & Thomas M. Surowiec
February 2020, Volume 45, Issue 1
- 1-14 The Euclidean k -Supplier Problem
by Viswanath Nagarajan & Baruch Schieber & Hadas Shachnai - 15-33 Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
by Antonio Frangioni & Claudio Gentile & James Hungerford - 34-62 Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
by Kousha Etessami & Alistair Stewart & Mihalis Yannakakis - 63-85 Finding a Stable Allocation in Polymatroid Intersection
by Satoru Iwata & Yu Yokoi - 86-98 Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
by Etienne de Klerk & Monique Laurent - 99-128 Discrete Midpoint Convexity
by Satoko Moriguchi & Kazuo Murota & Akihisa Tamura & Fabio Tardella - 129-156 Reference Dependence and Market Participation
by Paolo Guasoni & Andrea Meireles-Rodrigues - 157-190 On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games
by Jinlong Lei & Uday V. Shanbhag & Jong-Shi Pang & Suvrajeet Sen - 191-204 The Computational Complexity of Integer Programming with Alternations
by Danny Nguyen & Igor Pak - 205-232 Nonzero-Sum Stochastic Differential Games with Impulse Controls: A Verification Theorem with Applications
by René Aïd & Matteo Basei & Giorgia Callegaro & Luciano Campi & Tiziano Vargiolu - 233-271 On the Efficiency of Random Permutation for ADMM and Coordinate Descent
by Ruoyu Sun & Zhi-Quan Luo & Yinyu Ye - 272-291 On the Construction of Substitutes
by Eric Balkanski & Renato Paes Leme - 292-322 Trimmed Statistical Estimation via Variance Reduction
by Aleksandr Aravkin & Damek Davis - 323-352 Hiring Secretaries over Time: The Benefit of Concurrent Employment
by Yann Disser & John Fearnley & Martin Gairing & Oliver Göbel & Max Klimm & Daniel Schmand & Alexander Skopalik & Andreas Tönnis - 353-368 Random Serial Dictatorship: The One and Only
by Sophie Bade - 369-383 An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ 3
by Saladi Rahul - 384-401 Optimal Redeeming Strategy of Stock Loans Under Drift Uncertainty
by Zuo Quan Xu & Fahuai Yi
May 2019, Volume 44, Issue 2
- 377-399 Explore First, Exploit Next: The True Shape of Regret in Bandit Problems
by Aurélien Garivier & Pierre Ménard & Gilles Stoltz - 400-422 Rare Nash Equilibria and the Price of Anarchy in Large Static Games
by Daniel Lacker & Kavita Ramanan - 423-439 An Inverse Optimal Stopping Problem for Diffusion Processes
by Thomas Kruse & Philipp Strack - 440-467 A Tale of a Principal and Many, Many Agents
by Romuald Elie & Thibaut Mastrolia & Dylan Possamaï - 468-486 No-Arbitrage and Hedging with Liquid American Options
by Erhan Bayraktar & Zhou Zhou - 487-511 Approximation Algorithms for Dynamic Assortment Optimization Models
by Ali Aouad & Retsef Levi & Danny Segev - 512-531 A Solvable Two-Dimensional Degenerate Singular Stochastic Control Problem with Nonconvex Costs
by Tiziano De Angelis & Giorgio Ferrari & John Moriarty
February 2019, Volume 44, Issue 1
- 19-37 Discrete Approximation and Quantification in Distributionally Robust Optimization
by Yongchao Liu & Alois Pichler & Huifu Xu - 38-57 Risk-Averse Selfish Routing
by Thanasis Lianeas & Evdokia Nikolova & Nicolas E. Stier-Moses - 58-73 Efficient Simulation of High Dimensional Gaussian Vectors
by Nabil Kahalé - 74-101 Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras
by Antônio Francisco Neto - 102-121 A Market Impact Game Under Transient Price Impact
by Alexander Schied & Tao Zhang - 122-146 On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women
by Boris Pittel - 147-172 No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
by Abbas Bazzi & Samuel Fiorini & Sebastian Pokutta & Ola Svensson - 173-195 Weak Stability of ℓ 1 -Minimization Methods in Sparse Data Reconstruction
by Yun-Bin Zhao & Houyuan Jiang & Zhi-Quan Luo - 196-211 Expressiveness and Robustness of First-Price Position Auctions
by Paul Dütting & Felix Fischer & David C. Parkes - 212-235 Location Games on Networks: Existence and Efficiency of Equilibria
by Gaëtan Fournier & Marco Scarsini - 236-263 Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
by Alfredo N. Iusem & Alejandro Jofré & Philip Thompson - 264-276 The Entropic Barrier: Exponential Families, Log-Concave Geometry, and Self-Concordance
by Sébastien Bubeck & Ronen Eldan - 277-302 Zero-Sum Stopping Games with Asymmetric Information
by Fabien Gensbittel & Christine Grün - 303-333 Pricing Average and Spread Options Under Local-Stochastic Volatility Jump-Diffusion Models
by Kenichiro Shiraya & Akihiko Takahashi - 334-353 Unbiased Sensitivity Estimation of One-Dimensional Diffusion Processes
by Wanmo Kang & Jong Mun Lee - 354-375 Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
by Jian Li & Amol Deshpande - 1319-1348 Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
by Jan Ossenbrink & Joern Hoppmann
November 2018, Volume 43, Issue 4
- 1051-1071 Random Projections for Linear Programming
by Ky Vu & Pierre-Louis Poirion & Leo Liberti - 1072-1084 On the Complexity of Robust PCA and ℓ 1 -Norm Low-Rank Matrix Approximation
by Nicolas Gillis & Stephen A. Vavasis - 1085-1118 How to Calculate the Barycenter of a Weighted Graph
by Sébastien Gadat & Ioana Gavra & Laurent Risser - 1119-1142 Robust Dynamic Pricing with Strategic Customers
by Yiwei Chen & Vivek F. Farias - 1143-1176 Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
by D. Russell Luke & Nguyen H. Thao & Matthew K. Tam - 1177-1209 Optimal Stopping Under Uncertainty in Drift and Jump Intensity
by Volker Krätschmer & Marcel Ladkau & Roger J. A. Laeven & John G. M. Schoenmakers & Mitja Stadje - 1210-1232 Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
by Jérôme Bolte & Shoham Sabach & Marc Teboulle - 1233-1251 Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method
by Bruno F. Lourenço & Ellen H. Fukuda & Masao Fukushima - 1252-1268 Segmentation, Incentives, and Privacy
by Kobbi Nissim & Rann Smorodinsky & Moshe Tennenholtz - 1269-1289 The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard
by Tamar Cohen-Hillel & Liron Yedidsion - 1290-1316 Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
by Zhaosong Lu & Xiaorui Li - 1317-1325 Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing
by Etienne de Klerk & Monique Laurent - 1326-1347 A Single-Phase, Proximal Path-Following Framework
by Quoc Tran-Dinh & Anastasios Kyrillidis & Volkan Cevher - 1348-1377 Sample Path Large Deviations for Stochastic Evolutionary Game Dynamics
by William H. Sandholm & Mathias Staudigl - 1378-1404 Optimal Consumption and Portfolio Selection with Early Retirement Option
by Zhou Yang & Hyeng Keun Koo
August 2018, Volume 43, Issue 3
- 789-812 Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms
by Will Ma - 813-837 Liquidity, Risk Measures, and Concentration of Measure
by Daniel Lacker