Cover Image

Should We Relax Stability in Matching Markets?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bertsimas, Dimitris, Gao, Carol
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Global Optimization via Optimal Decision Trees
by: Bertsimas, Dimitris, et al.
Published: (2022)

Robust and Adaptive Optimization under a Large Language Model Lens
by: Bertsimas, Dimitris, et al.
Published: (2024)

From Data to Uncertainty Sets: a Machine Learning Approach
by: Bertsimas, Dimitris, et al.
Published: (2025)

Overfitting in Adaptive Robust Optimization
by: Zhu, Karl, et al.
Published: (2025)

Global Optimization: A Machine Learning Approach
by: Bertsimas, Dimitris, et al.
Published: (2023)

Catastrophe Insurance: An Adaptive Robust Optimization Approach
by: Bertsimas, Dimitris, et al.
Published: (2024)

Robust Regression over Averaged Uncertainty
by: Bertsimas, Dimitris, et al.
Published: (2023)

A Machine Learning Approach to Two-Stage Adaptive Robust Optimization
by: Bertsimas, Dimitris, et al.
Published: (2023)

A novel exact approach to polynomial optimization
by: Bertsimas, Dimitris, et al.
Published: (2025)

Sparse Classification: a scalable discrete optimization perspective
by: Bertsimas, Dimitris, et al.
Published: (2017)

The Benefit of Uncertainty Coupling in Robust and Adaptive Robust Optimization
by: Bertsimas, Dimitris, et al.
Published: (2023)

Global Nonconvex Optimization with Integer Variables
by: Bertsimas, Dimitris, et al.
Published: (2025)

A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design
by: Bertsimas, Dimitris, et al.
Published: (2023)

A new perspective on low-rank optimization
by: Bertsimas, Dimitris, et al.
Published: (2021)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

Towards Stable Machine Learning Model Retraining via Slowly Varying Sequences
by: Bertsimas, Dimitris, et al.
Published: (2024)

Should Sports Professionals Consider Their Adversary's Strategy? A Case Study of Match Play in Golf
by: Wajge, Nishad, et al.
Published: (2023)

Tilt Stability for Nonlinear Programs under Relaxed Constant Rank Constraint Qualification
by: Chieu, Nguyen Huy, et al.
Published: (2025)

When to Match: A Cost-Balancing Principle for Dynamic Markets
by: Liu, Jie, et al.
Published: (2026)

Pricing Discrete and Nonlinear Markets With Semidefinite Relaxations
by: Guo, Cheng, et al.
Published: (2026)

Flow Matching for Measure Transport and Feedback Stabilization of Control-Affine Systems
by: Elamvazhuthi, Karthik
Published: (2025)

MIP Relaxations in Factorable Programming
by: He, Taotao, et al.
Published: (2023)

On the Strength of Linear Relaxations in Ordered Optimization
by: Blanco, Víctor, et al.
Published: (2025)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

Centering ADMM for the Semidefinite Relaxation of the QAP
by: Kanoh, Shin-ichi, et al.
Published: (2020)

Relaxation methods for pessimistic bilevel optimization
by: Benchouk, Imane, et al.
Published: (2024)

Elliptic Relaxation Strategies to Support Numerical Stability of Segregated Continuous Adjoint Flow Solvers
by: Kühl, Niklas
Published: (2025)

Inverse of the Gomory Corner Relaxation of Integer Programs
by: Lyu, George, et al.
Published: (2024)

Accurate Linear Cutting-Plane Relaxations for ACOPF
by: Bienstock, Daniel, et al.
Published: (2023)

Superquantile-Gibbs Relaxation for Minima-selection in Bilevel Optimization
by: Masiha, Saeed, et al.
Published: (2025)

Nonlinear Dynamical Unbalanced Optimal Transport: Relaxation and Duality
by: Wu, Dongjun, et al.
Published: (2025)

Learning to Relax Nonconvex Quadratically Constrained Quadratic Programs
by: Dedeoglu, Muge, et al.
Published: (2025)

A Dynamic Relaxation Framework for Global Solution of ACOPF
by: Tang, Yu-Yang, et al.
Published: (2025)

Decentralized Relaxed Smooth Optimization with Gradient Descent Methods
by: Jiang, Zhanhong, et al.
Published: (2025)

Exactness of the DNN Relaxation for Random Standard Quadratic Programs
by: Chen, Xin
Published: (2026)

Polynomial Optimization Relaxations for Generalized Semi-Infinite Programs
by: Hu, Xiaomeng, et al.
Published: (2023)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
by: Shah, Prachi, et al.
Published: (2024)

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
by: Chen, Junyu, et al.
Published: (2024)

Position: Optimization in SciML Should Employ the Function Space Geometry
by: Müller, Johannes, et al.
Published: (2024)

A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem
by: Shen, Yuting, et al.
Published: (2025)