Printed from https://ideas.repec.org/s/inm/ormoor2.html
Content
February 2023, Volume 48, Issue 1
- 463-497 Modelling Multiperiod Carbon Markets Using Singular Forward-Backward SDEs
by Jean-François Chassagneux & Hinesh Chotai & Dan Crisan - 498-519 Pandora’s Box Problem with Order Constraints
by Shant Boodaghians & Federico Fusco & Philip Lazos & Stefano Leonardi - 520-543 Contingent Capital with Stock Price Triggers in Interbank Networks
by Anne G. Balter & Nikolaus Schweizer & Juan C. Vera - 544-568 Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon
by Chonghu Guan & Zuo Quan Xu & Rui Zhou - 569-582 A Convex Form That Is Not a Sum of Squares
by James Saunderson - 583-602 Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
by George Christodoulou & Martin Gairing & Yiannis Giannakopoulos & Diogo Poças & Clara Waldmann
November 2022, Volume 47, Issue 4
- 2547-2584 Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
by Jinhak Kim & Mohit Tawarmalani & Jean-Philippe P. Richard - 2585-2613 A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint
by Ningyuan Chen & Guillermo Gallego - 2614-2640 Local Density Estimation in High Dimensions
by Xian Wu & Moses Charikar & Vishnu Natchu - 2641-2666 Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
by Ion Necoara & Olivier Fercoq - 2667-2690 An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
by Naor Alaluf & Alina Ene & Moran Feldman & Huy L. Nguyen & Andrew Suh - 2691-2720 Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
by Weina Wang & Siva Theja Maguluri & R. Srikant & Lei Ying - 2721-2742 A Unified Framework for Bayesian and Non-Bayesian Decision Making and Inference
by Massimiliano Amarante - 2743-2764 Equilibria in Multiclass and Multidimensional Atomic Congestion Games
by Max Klimm & Andreas Schütz - 2765-2783 The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property
by Xianfu Wang & Ziyuan Wang - 2784-2814 Suboptimal Local Minima Exist for Wide Neural Networks with Smooth Activations
by Tian Ding & Dawei Li & Ruoyu Sun - 2815-2839 Satisficing in Time-Sensitive Bandit Learning
by Daniel Russo & Benjamin Van Roy - 2840-2890 Finite State Mean Field Games with Wright–Fisher Common Noise as Limits of N -Player Weighted Games
by Erhan Bayraktar & Alekos Cecchin & Asaf Cohen & François Delarue - 2891-2930 McKean–Vlasov Optimal Control: Limit Theory and Equivalence Between Different Formulations
by Mao Fabrice Djete & Dylan Possamaï & Xiaolu Tan - 2931-2949 A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
by Guyan Ni & Ying Li - 2950-2988 Distributionally Robust Chance Constrained Geometric Optimization
by Jia Liu & Abdel Lisser & Zhiping Chen - 2989-3009 On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
by Jonathan D. Hauenstein & Ali Mohammad-Nezhad & Tingting Tang & Tamás Terlaky - 3010-3024 Stackelberg Max Closure with Multiple Followers
by Karsten Jungnitsch & Britta Peis & Marc Schröder - 3025-3050 Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
by Rujun Jiang & Xudong Li - 3051-3083 Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
by Junyi Liu & Ying Cui & Jong-Shi Pang - 3084-3109 Forbidden Transactions and Black Markets
by Chenlin Gu & Alvin Roth & Qingyun Wu - 3110-3128 Gale’s Fixed Tax for Exchanging Houses
by Tommy Andersson & Lars Ehlers & Lars-Gunnar Svensson & Ryan Tierney - 3129-3155 Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
by Daniela Andrea Hurtado Lange & Siva Theja Maguluri - 3156-3183 A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem
by Rob Van Eynde & Mario Vanhoucke - 3184-3206 Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions
by Rodolfo Ríos-Zertuche - 3207-3238 Pipeline Interventions
by Eshwar Ram Arunachaleswaran & Sampath Kannan & Aaron Roth & Juba Ziani - 3239-3260 Entropy Regularization for Mean Field Games with Learning
by Xin Guo & Renyuan Xu & Thaleia Zariphopoulou - 3261-3281 Bounding Residence Times for Atomic Dynamic Routings
by Zhigang Cao & Bo Chen & Xujin Chen & Changjun Wang - 3282-3303 Slater Condition for Tangent Derivatives
by Xi Yin Zheng - 3304-3316 Projection and Rescaling Algorithm for Finding Maximum Support Solutions to Polyhedral Conic Systems
by Javier Peña & Negar Soheili - 3317-3356 Adaptive Bin Packing with Overflow
by Sebastian Perez-Salazar & Mohit Singh & Alejandro Toriello - 3357-3379 Consensus Halving for Sets of Items
by Paul W. Goldberg & Alexandros Hollender & Ayumi Igarashi & Pasin Manurangsi & Warut Suksompong - 3380-3399 Hypergraph k -Cut for Fixed k in Deterministic Polynomial Time
by Karthekeyan Chandrasekaran & Chandra Chekuri
August 2022, Volume 47, Issue 3
- 1707-1730 A Stochastic Representation for Nonlocal Parabolic PDEs with Applications
by Min Dai & Steven Kou & Chen Yang - 1731-1756 The Buck-Passing Game
by Roberto Cominetti & Matteo Quattropani & Marco Scarsini - 1757-1780 Distributionally Robust Markov Decision Processes and Their Connection to Risk Measures
by Nicole Bäuerle & Alexander Glauner - 1781-1801 Equilibria and Systemic Risk in Saturated Networks
by Leonardo Massai & Giacomo Como & Fabio Fagnani - 1802-1832 Optimal Retirement Under Partial Information
by Kexin Chen & Junkee Jeon & Hoi Ying Wong - 1833-1861 A Class of Recursive Optimal Stopping Problems with Applications to Stock Trading
by Katia Colaneri & Tiziano De Angelis - 1862-1874 Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems
by David Gamarnik & John N. Tsitsiklis & Martin Zubeldia - 1875-1903 Fair Cake Division Under Monotone Likelihood Ratios
by Siddharth Barman & Nidhi Rathi - 1904-1931 Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability
by David Simchi-Levi & Yunzong Xu - 1932-1956 Sparse Solutions of a Class of Constrained Optimization Problems
by Lei Yang & Xiaojun Chen & Shuhuang Xiang - 1957-1969 Consumption Smoothing and Discounting in Infinite-Horizon, Discrete-Choice Problems
by Jeremy Kettering & Asen Kochov - 1970-1998 Fully Polynomial-Time Approximation Schemes for Fair Rent Division
by Eshwar Ram Arunachaleswaran & Siddharth Barman & Nidhi Rathi - 1999-2033 Impact of Network Structure on New Service Pricing
by Saed Alizamir & Ningyuan Chen & Sang-Hyun Kim & Vahideh Manshadi - 2034-2064 Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization
by Zhengling Qi & Ying Cui & Yufeng Liu & Jong-Shi Pang - 2065-2081 Parametric Shortest-Path Algorithms via Tropical Geometry
by Michael Joswig & Benjamin Schröter - 2082-2111 Distributed Stochastic Optimization with Large Delays
by Zhengyuan Zhou & Panayotis Mertikopoulos & Nicholas Bambos & Peter Glynn & Yinyu Ye - 2112-2137 Optimal Electricity Demand Response Contracting with Responsiveness Incentives
by René Aïd & Dylan Possamaï & Nizar Touzi - 2138-2159 Analyzing Approximate Value Iteration Algorithms
by Arunselvan Ramaswamy & Shalabh Bhatnagar - 2160-2185 On Optimality Conditions for Nonlinear Conic Programming
by Roberto Andreani & Walter Gómez & Gabriel Haeser & Leonardo M. Mito & Alberto Ramos - 2186-2218 Small-Loss Bounds for Online Learning with Partial Information
by Thodoris Lykouris & Karthik Sridharan & Éva Tardos - 2219-2239 On Degenerate Doubly Nonnegative Projection Problems
by Ying Cui & Ling Liang & Defeng Sun & Kim-Chuan Toh - 2240-2259 Correlated Equilibria and Mean Field Games: A Simple Model
by Luciano Campi & Markus Fischer - 2260-2285 Penalty and Augmented Lagrangian Methods for Constrained DC Programming
by Zhaosong Lu & Zhe Sun & Zirui Zhou - 2286-2309 Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online
by Georgios Amanatidis & Pieter Kleer & Guido Schäfer - 2310-2332 Asymptotically Optimal Sequential Design for Rank Aggregation
by Xi Chen & Yunxiao Chen & Xiaoou Li - 2333-2343 A Result on Convergence of Sequences of Iterations with Applications to Best-Response Dynamics
by Wojciech Olszewski - 2344-2365 Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems
by Helmut Gfrerer & Jane J. Ye & Jinchuan Zhou - 2366-2386 One-Step Estimation with Scaled Proximal Methods
by Robert Bassett & Julio Deride - 2387-2414 Distributionally Robust Inventory Control When Demand Is a Martingale
by Linwei Xin & David Alan Goldberg - 2415-2443 Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
by Radu Ioan Boţ & Minh N. Dao & Guoyin Li - 2444-2463 Projectively Self-Concordant Barriers
by Roland Hildebrand - 2464-2493 Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
by Yingjie Fei & Yudong Chen - 2494-2519 Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures
by Fangda Liu & Tiantian Mao & Ruodu Wang & Linxiao Wei - 2520-2545 Algorithms for Persuasion with Limited Communication
by Ronen Gradwohl & Niklas Hahn & Martin Hoefer & Rann Smorodinsky
May 2022, Volume 47, Issue 2
- 847-877 Proportional Volume Sampling and Approximation Algorithms for A -Optimal Design
by Aleksandar Nikolov & Mohit Singh & Uthaipon (Tao) Tantipongpipat - 878-898 Prophet Matching with General Arrivals
by Tomer Ezra & Michal Feldman & Nick Gravin & Zhihao Gavin Tang - 899-922 Scalar Multivariate Risk Measures with a Single Eligible Asset
by Zachary Feinstein & Birgit Rudloff - 923-944 The Pareto Frontier of Inefficiency in Mechanism Design
by Aris Filos-Ratsikas & Yiannis Giannakopoulos & Philip Lazos - 945-968 Dynamic Fair Resource Division
by Shai Vardi & Alexandros Psomas & Eric Friedman - 969-988 Reducing Bias in Event Time Simulations via Measure Changes
by Kay Giesecke & Alexander Shkolnik - 989-994 Linear and Utilitarian Choice Functions: Revisiting Myerson’s Theorem
by Benjamin Bachi & Shiran Rachmilevitch - 995-1025 Coordination Games on Weighted Directed Graphs
by Krzysztof R. Apt & Sunil Simon & Dominik Wojtczak - 1026-1047 A Discrete Convex Min-Max Formula for Box-TDI Polyhedra
by András Frank & Kazuo Murota - 1048-1081 Strong Embeddings for Transitory Queueing Models
by Prakash Chakraborty & Harsha Honnappa - 1082-1109 Multivariate Monotone Inclusions in Saddle Form
by Minh N. Bùi & Patrick L. Combettes - 1110-1140 Tractable Relaxations of Composite Functions
by Taotao He & Mohit Tawarmalani - 1141-1168 Geometrically Convergent Simulation of the Extrema of Lévy Processes
by Jorge Ignacio González Cázares & Aleksandar Mijatović & Gerónimo Uribe Bravo - 1169-1191 Directional Necessary Optimality Conditions for Bilevel Programs
by Kuang Bai & Jane J. Ye - 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