Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods

arXiv:2108.05165 · cs.AI · Submitted 2021-08-11 · Read on arXiv

cs.AI

Submitted: 2021-08-11

Updated: 2026-09-21

Comments: The experimental results are revised

Code: https://github.com/KRR-SU/SMTI-TPLP-2021

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Stable Marriage Problem — 22× in this paper
• Answer Set Programming — 14× in this paper
• Objective Function — 7× in this paper · explained in 2 episodes
• Constraint Programming — 6× in this paper
• Integer Linear Programming — 5× in this paper
• Benchmark — 4× in this paper · explained in 2 episodes
• Adaptation — 2× in this paper · explained in 1 episode
• Theory and Practice of Logic Programming — 2× in this paper

Related papers

• MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
• Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
• The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
• MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
• Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems
• VSAL: A Vision Solver with Adaptive Layouts for Graph Property Detection