Efficiency in the Roommates Problem
Computer Science and Game Theory
2025-03-04 v2 Data Structures and Algorithms
Theoretical Economics
Authors:
Keita Kuwahara
Abstract
We propose an O(n2)-time algorithm to determine whether a given matching is efficient in the roommates problem.
Keywords
Cite
@article{arxiv.2502.16960,
title = {Efficiency in the Roommates Problem},
author = {Keita Kuwahara},
journal= {arXiv preprint arXiv:2502.16960},
year = {2025}
}
Related papers
View all related →
Data Structures and Algorithms · Computer Science
Stable Roommates Problem with Random Preferences
Stephan Mertens
2015-01-22
Computational Complexity · Computer Science
Marriage and Roommate
Kazuo Iwama, Shuichi Miyazaki
2023-05-23
Artificial Intelligence · Computer Science
Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems
Müge Fidan, Esra Erdem
2025-07-29
Social and Information Networks · Computer Science
Roommate Compatibility Detection Through Machine Learning Techniques
Mansha Lamba, Raunak Goswami, Vinay, Mohit Lamba
2024-09-05
Numerical Analysis · Mathematics
An Algorithm for Optimal Partitioning of Data on an Interval
Brad Jackson, Jeffrey D. Scargle, David Barnes, Sundararajan Arabhi +6
2025-10-20
Quantum Physics · Physics
Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness
Chris Cade, Ashley Montanaro, Aleksandrs Belovs
2016-10-04
Data Structures and Algorithms · Computer Science
Testing Upward Planarity of Partial $2$-Trees
Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian +2
2022-08-29
Computational Geometry · Computer Science
Limited-Capacity Many-To-Many Point Matching in One Dimension
Fatemeh Rajabi-Alni, Alireza Bagheri
2012-10-31
Data Structures and Algorithms · Computer Science
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
Frederik Glitzner, David Manlove
2024-11-26
Data Structures and Algorithms · Computer Science
The Exchange Problem
Mohit Garg, Suneel Sarswat
2024-03-06
Data Structures and Algorithms · Computer Science
Faster and simpler approximation of stable matchings
Katarzyna Paluch
2014-04-07
Computer Science and Game Theory · Computer Science
The Strongly Stable Roommates Problem and Linear Programming
Naoyuki Kamiyama
2025-10-21
Computational Geometry · Computer Science
Embedding into the rectilinear plane in optimal O*(n^2)
Nicolas Catusse, Victor Chepoi, Yann Vaxès
2011-07-08
Computer Science and Game Theory · Computer Science
The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences
Michael McKay, David Manlove
2021-07-12
Data Structures and Algorithms · Computer Science
Counting Perfect Matchings as Fast as Ryser
Andreas Björklund
2011-10-17
Data Structures and Algorithms · Computer Science
Two-sided profile-based optimality in the stable marriage problem
Frances Cooper, David Manlove
2020-09-14
Computer Science and Game Theory · Computer Science
A Linear Programming Approach to the Super-Stable Roommates Problem
Naoyuki Kamiyama
2025-06-02
Data Structures and Algorithms · Computer Science
Efficient Parallel and External Matching
Marcel Birn, Vitaly Osipov, Peter Sanders, Christian Schulz +1
2014-02-04
Computer Science and Game Theory · Computer Science
Stable Roommate Problem with Diversity Preferences
Niclas Boehmer, Edith Elkind
2020-05-01
Data Structures and Algorithms · Computer Science
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings
Itai Boneh, Shay Golan, Shay Mozes, Oren Weimann
2023-02-14
Data Structures and Algorithms · Computer Science
Popular Matching in Roommates Setting is NP-hard
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018-03-28
Neural and Evolutionary Computing · Computer Science
Effective anytime algorithm for multiobjective combinatorial optimization problems
Miguel Ángel Domínguez-Ríos, Francisco Chicano, Enrique Alba
2024-03-20
Computer Science and Game Theory · Computer Science
Algorithms for Stable Roommate with Externalities
Jing Leng, Sanjukta Roy
2025-08-21
Data Structures and Algorithms · Computer Science
A new algorithm for Many to Many Matching with Demands and Capacities
Fatemeh Rajabi-Alni
2013-02-19
Data Structures and Algorithms · Computer Science
Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
Gergely Csáji
2025-10-07