Efficiency in the Roommates Problem
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915178354835456 |
|---|---|
| author | Kuwahara, Keita |
| author_facet | Kuwahara, Keita |
| contents | We propose an $O(n^2)$-time algorithm to determine whether a given matching is efficient in the roommates problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_16960 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficiency in the Roommates Problem Kuwahara, Keita Computer Science and Game Theory Data Structures and Algorithms Theoretical Economics We propose an $O(n^2)$-time algorithm to determine whether a given matching is efficient in the roommates problem. |
| title | Efficiency in the Roommates Problem |
| topic | Computer Science and Game Theory Data Structures and Algorithms Theoretical Economics |
| url | https://arxiv.org/abs/2502.16960 |