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

We study a variation of the Stable Marriage problem, where every man and every woman express their preferences as preference lists which may be incomplete and contain ties. This problem is called the Stable Marriage problem with Ties and Incomplete preferences (SMTI). We consider three optimization...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-08
Hauptverfasser:	Eyupoglu, Selin, Fidan, Muge, Gulesen, Yavuz, Ilayda Begum Izci, Teber, Berkan, Yilmaz, Baturay, Alkan, Ahmet, Erdem, Esra
Format:	Artikel
Sprache:	eng
Schlagworte:	Declarative programming Integer programming Linear programming Logic programming Marriage Mathematical programming Optimization Search methods
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!