default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 48
Volume 48, Number 1, February 2023
- Viet Anh Nguyen
, Soroosh Shafieezadeh-Abadeh, Daniel Kuhn, Peyman Mohajerin Esfahani:
Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimization. 1-37 - Nick Gravin, Hongao Wang:
Prophet Inequality for Bipartite Matching: Merits of Being Simple and Nonadaptive. 38-52 - Eyal Gur, Shoham Sabach, Shimrit Shtern:
Convergent Nested Alternating Minimization Algorithms for Nonconvex Optimization Problems. 53-77 - Giovanni Conforti, Anna Kazeykina, Zhenjie Ren:
Game on Random Environment, Mean-Field Langevin System, and Neural Networks. 78-99 - C. J. Argue, Fatma Kilinç-Karzan, Alex L. Wang:
Necessary and Sufficient Conditions for Rank-One-Generated Cones. 100-126 - David H. Gutman, Nam Ho-Nguyen:
Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds. 127-159 - Anna Bogomolnaia, Hervé Moulin:
Guarantees in Fair Division: General or Monotone Preferences. 160-176 - Liwei Zhang, Yule Zhang, Xiantao Xiao, Jia Wu:
Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming. 177-193 - Sergey Avvakumov, Roman N. Karasev:
Equipartition of a Segment. 194-202 - Vineet Goyal, Julien Grand-Clément:
Robust Markov Decision Processes: Beyond Rectangularity. 203-226 - Daan Rutten, Debankur Mukherjee:
Load Balancing Under Strict Compatibility Constraints. 227-256 - Gadi Fibich, Amit Golan:
Diffusion of New Products with Heterogeneous Consumers. 257-287 - Lijun Bo, Agostino Capponi, Chao Zhou:
Power Forward Performance in Semimartingale Markets with Stochastic Integrated Factors. 288-312 - Siddharth Barman, Federico Echenique:
The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. 313-331 - Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre:
New Constructions of Obviously Strategyproof Mechanisms. 332-362 - Shipra Agrawal, Randy Jia:
Optimistic Posterior Sampling for Reinforcement Learning: Worst-Case Regret Bounds. 363-392 - Samuel C. Gutekunst, David P. Williamson:
The Circlet Inequalities: A New, Circulant-Based, Facet-Defining Inequality for the TSP. 393-418 - Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman:
The Big Match with a Clock and a Bit of Memory. 419-432 - Qiaomin Xie, Yudong Chen, Zhaoran Wang, Zhuoran Yang:
Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium. 433-462 - Jean-François Chassagneux, Hinesh Chotai, Dan Crisan:
Modelling Multiperiod Carbon Markets Using Singular Forward-Backward SDEs. 463-497 - Shant Boodaghians, Federico Fusco, Philip Lazos, Stefano Leonardi:
Pandora's Box Problem with Order Constraints. 498-519 - Anne G. Balter, Nikolaus Schweizer, Juan Carlos Vera:
Contingent Capital with Stock Price Triggers in Interbank Networks. 520-543 - Chonghu Guan, Zuo Quan Xu, Rui Zhou:
Dynamic Optimal Reinsurance and Dividend Payout in Finite Time Horizon. 544-568 - James Saunderson:
A Convex Form That Is Not a Sum of Squares. 569-582 - George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. 583-602
Volume 48, Number 2, May 2023
- Rui Gao, Anton J. Kleywegt:
Distributionally Robust Stochastic Optimization with Wasserstein Distance. 603-655 - Xin Guo, Anran Hu, Renyuan Xu, Junzi Zhang:
A General Framework for Learning Mean-Field Games. 656-686 - Jake Clarkson, Kyle Y. Lin, Kevin D. Glazebrook:
A Classical Search Game in Discrete Locations. 687-707 - János Flesch, Arkadi Predtetchinski, Ville Suomala:
Random Perfect Information Games. 708-727 - Efe A. Ok, Nik Weaver:
Lipschitz Bernoulli Utility Functions. 728-747 - Burak Büke, Wenyi Qin:
Many-Server Queues with Random Service Rates: A Unified Framework Based on Measure-Valued Processes. 748-783 - Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Approximation and Convergence of Large Atomic Congestion Games. 784-811 - Ngoc Hoang Anh Mai, Victor Magron, Jean B. Lasserre:
A Sparse Version of Reznick's Positivstellensatz. 812-833 - Ehud Lehrer, Dimitry Shaiderman:
Repeated Games with Incomplete Information over Predictable Systems. 834-864 - Marco Molinaro:
Strong Convexity of Feasible Sets in Off-line and Online Optimization. 865-884 - Alberto Del Pia, Aida Khajavirad, Dmitriy Kunisky:
Linear Programming and Community Detection. 885-913 - Benoit Duvocelle, Panayotis Mertikopoulos, Mathias Staudigl, Dries Vermeulen:
Multiagent Online Learning in Time-Varying Games. 914-941 - Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber:
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. 942-953 - Dmitriy Drusvyatskiy, Lin Xiao:
Stochastic Optimization with Decision-Dependent Distributions. 954-998 - Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi, Chris Sholley:
Edge-Weighted Online Windowed Matching. 999-1016 - Monique Laurent, Luis Felipe Vargas:
Exactness of Parrilo's Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph. 1017-1043 - Thomas Kerdreux, Igor Colin, Alexandre d'Aspremont:
Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems. 1044-1065 - Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro:
Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints. 1066-1094 - Marcel Nutz, Yuchong Zhang:
Mean Field Contest with Singularity. 1095-1118 - Lun Yu, Ohad Perry:
Many-Server Heavy-Traffic Limits for Queueing Systems with Perfectly Correlated Service and Patience Times. 1119-1157 - Mario Ghossoub, Jesse Hall, David Saunders:
Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions. 1158-1182 - Jiaxiang Li, Krishnakumar Balasubramanian, Shiqian Ma:
Stochastic Zeroth-Order Riemannian Derivative Estimation and Optimization. 1183-1211
Volume 48, Number 3, August 2023
- Kei Noba, Kazutoshi Yamazaki:
On Singular Control for Lévy Processes. 1213-1234 - Rujun Jiang, Duan Li:
Exactness Conditions for Semidefinite Programming Relaxations of Generalization of the Extended Trust Region Subproblem. 1235-1253 - Sina Sanjari, Naci Saldi, Serdar Yüksel:
Optimality of Independently Randomized Symmetric Policies for Exchangeable Stochastic Teams with Infinitely Many Decision Makers. 1254-1285 - Martin Herdegen, Johannes Muhle-Karbe, Florian Stebegg:
Liquidity Provision with Adverse Selection and Inventory Costs. 1286-1315 - Amir Ali Ahmadi, Cemil Dibek, Georgina Hall:
Sums of Separable and Quadratic Polynomials. 1316-1343 - Daniel Freund, Jiayu (Kamessi) Zhao:
Overbooking with Bounded Loss. 1344-1363 - Zijun Wu, Rolf H. Möhring:
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games. 1364-1392 - András Frank, Kazuo Murota:
Fair Integral Network Flows. 1393-1422 - Johannes Muhle-Karbe, Xiaofei Shi, Chen Yang:
An Equilibrium Model for the Cross Section of Liquidity Premia. 1423-1453 - Denis Belomestny, Christian Bender, John Schoenmakers:
Solving Optimal Stopping Problems via Randomization and Empirical Dual Optimization. 1454-1480 - Klaus Jansen, Lars Rohwedder:
On Integer Programming, Discrepancy, and Convolution. 1481-1495 - Chi Jin, Zhuoran Yang, Zhaoran Wang, Michael I. Jordan:
Provably Efficient Reinforcement Learning with Linear Function Approximation. 1496-1521 - Yukun Cheng, Xiaotie Deng, Qi Qi, Xiang Yan:
Truthfulness of a Network Resource-Sharing Protocol. 1522-1552 - Neil Walton, Denis Denisov:
Regret Analysis of a Markov Policy Gradient Algorithm for Multiarm Bandits. 1553-1588 - Philip A. Ernst, Hongwei Mei:
Exact Optimal Stopping for Multidimensional Linear Switching Diffusions. 1589-1606 - Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab Mirrokni, Jon Schneider:
Contextual Bandits with Cross-Learning. 1607-1629 - Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin, Ruta Mehta:
A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna. 1630-1656 - Alois Pichler, Ruben Schlotter:
Risk-Averse Optimal Control in Continuous Time by Nesting Risk Measures. 1657-1678 - Jodi Dianetti, Giorgio Ferrari, Markus Fischer, Max Nendel:
A Unifying Framework for Submodular Mean Field Games. 1679-1710 - Michael P. Friedlander, Ariel Goodwin, Tim Hoheisel:
From Perspective Maps to Epigraphical Projections. 1711-1740 - Leon Sering, Laura Vargas Koch, Theresa Ziemke:
Convergence of a Packet Routing Model to Flows over Time. 1741-1766 - Mingshang Hu, Shaolin Ji, Xiaole Xue:
Optimization Under Rational Expectations: A Framework of Fully Coupled Forward-Backward Stochastic Linear Quadratic Systems. 1767-1790 - Kang Liu, Nadia Oudjane, Cheng Wan:
Approximate Nash Equilibria in Large Nonconvex Aggregative Games. 1791-1809
Volume 48, Number 4, 2023
- Pham Duy Khanh, Boris S. Mordukhovich, Vo Thanh Phat:
A Generalized Newton Method for Subgradient Systems. 1811-1845 - Pieter Kleer:
Sampling from the Gibbs Distribution in Congestion Games. 1846-1870 - Haoyang Cao, Jodi Dianetti, Giorgio Ferrari:
Stationary Discounted and Ergodic Mean Field Games with Singular Controls. 1871-1898 - Yevgeny Tsodikovich, Xavier Venel, Anna Zseleva:
The Regularity of the Value Function of Repeated Games with Switching Costs. 1899-1905 - Chris Coey, Lea Kapelevich, Juan Pablo Vielma:
Conic Optimization with Spectral Functions on Euclidean Jordan Algebras. 1906-1933 - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. 1934-1958 - Alexander Braun, Thomas Kesselheim:
Truthful Mechanisms for Two-Sided Markets via Prophet Inequalities. 1959-1986 - Daniel Lacker, Agathe Soret:
A Label-State Formulation of Stochastic Graphon Games and Approximate Equilibria on Large Networks. 1987-2018 - Chang-Han Rhee, Peter W. Glynn:
Lyapunov Conditions for Differentiability of Markov Chain Expectations. 2019-2042 - Othman El Balghiti, Adam N. Elmachtoub, Paul Grigas, Ambuj Tewari:
Generalization Bounds in the Predict-Then-Optimize Framework. 2043-2065 - Ali Devran Kara, Serdar Yüksel:
Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability. 2066-2093 - Dan Garber, Atara Kaplan:
On the Efficient Implementation of the Matrix Exponentiated Gradient Algorithm for Low-Rank Matrix Optimization. 2094-2128 - Daniel Bartl, Ludovic Tangpi:
Nonasymptotic Convergence Rates for the Plug-in Estimation of Risk Measures. 2129-2155 - Guillaume Garnier, Bruno Ziliotto:
Percolation Games. 2156-2166 - Lukas Graf, Tobias Harks:
The Price of Anarchy for Instantaneous Dynamic Equilibria. 2167-2195 - Asaf B. Cassel, Shie Mannor, Assaf Zeevi:
A General Framework for Bandit Problems Beyond Cumulative Objectives. 2196-2232 - Zhou Zhou:
Optimal Relative Performance Criteria in Mean-Field Contribution Games. 2233-2266 - Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu:
Polynomial Upper Bounds on the Number of Differing Columns of ?-Modular Integer Programs. 2267-2286 - Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
Reduction of Potential-Based Flow Networks. 2287-2303 - Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson:
Erratum to "Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems". 2304-2307 - Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright:
Optimal Oracle Inequalities for Projected Fixed-Point Equations, with Applications to Policy Evaluation. 2308-2336 - Nadav Hallak, Marc Teboulle:
An Adaptive Lagrangian-Based Scheme for Nonconvex Composite Optimization. 2337-2352 - Tianyi Lin, Michael I. Jordan:
Monotone Inclusions, Acceleration, and Closed-Loop Control. 2353-2382
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 2025-02-25 23:37 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:
