Scholarlink

We study the 3D-Euclidean Multidimensional Stable Roommates problem with (strict) popularity. An agent’s preference depends solely on the distance to its roommates. It prefers to be in a room where the sum of the distances to its roommates is minimal. We show that determining the existence of a strictly popular outcome in a 3D-Euclidean Multidimensional Stable Roommates game with room size 3 is co-NP-hard.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Popularity on the 3D-Euclidean Stable Roommates

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Steven Ge,
  • Toshiya Itoh

摘要

We study the 3D-Euclidean Multidimensional Stable Roommates problem with (strict) popularity. An agent’s preference depends solely on the distance to its roommates. It prefers to be in a room where the sum of the distances to its roommates is minimal. We show that determining the existence of a strictly popular outcome in a 3D-Euclidean Multidimensional Stable Roommates game with room size 3 is co-NP-hard.