A General Framework for Stable Roommates Problems using Answer Set Programming
From MaRDI portal
Publication:5140025
DOI10.1017/S1471068420000277zbMath1468.68197arXiv2008.03050OpenAlexW3087934398MaRDI QIDQ5140025
Müge Fidan, Patrick Prosser, David F. Manlove, Esra Erdem
Publication date: 13 December 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03050
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17) Matching models (91B68)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ``Almost stable matchings in the roommates problem with bounded preference lists
- Pairwise kidney exchange
- Geometric stable roommates
- Stable marriage with ties and bounded length preference lists
- A new fixed point approach for stable networks and stable marriages
- Stable marriage and indifference
- Extending and implementing the stable model semantics
- The stable roommates problem with short lists
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- The Stable Roommates Problem with Ties
- NP-complete stable matching problems
- An efficient algorithm for the “stable roommates” problem
- The Strongly Stable Roommates Problem
- Tight logic programs
- Random stable matchings
- Stable Roommates and Constraint Programming
- Approximation and Online Algorithms
- College Admissions and the Stability of Marriage