Online Roommate Allocation Problem

Huzhang, Guangda; Huang, Xin; Zhang, Shengyu; Bei, Xiaohui

doi:10.24963/ijcai.2017/34

Cited by 16 publications

(23 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They also studied stable room allocation. Huzhang et al [2] investigated the online situation and assumed that all the agents arrive online in uniformly random order. They presented an online algorithm with constant competitive ratio with respect to the optimal social welfare.…”

Section: Related Workmentioning

confidence: 99%

“…Room allocation is a frequently encountered problem in practice, e.g., allocating dorms among college students and allocating rooms among tenants [1], [2]. It has attracted the attention of economists and computer scientists for more than sixty years.…”

Section: Introductionmentioning

confidence: 99%

“…We mainly focus on finding an allocation that maximizes the social welfare that is defined as the utility sum of the agents, including the room owner (such as the university). Typically, this objective is discussed in the resource allocation literature [1], [2], [15]- [17]. This paper also investigates how to find a roommate stable allocation with a social welfare guarantee, in which no pair of agents who live in different rooms can increase both their utilities by swapping while ensuring that no agent's utility decreases.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Room Allocation With Capacity Diversity and Budget Constraints

Liu

Jiang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

With the development of the room rental market, many room rental websites have been created, e.g., SpareRoom and EasyRoommate. On these websites, people find not only rooms for rent but also suitable roommates. Inspired by the rental mode in practice, a benchmark room allocation model was introduced by Chan et al., in which 2n agents must be allocated to n rooms that have the same capacity and each agent can be allocated to any room. However, in practice, rooms may differ in terms of capacity, e.g., college dorms or apartments may contain both two-bed rooms and four-bed rooms. Moreover, an agent can only be allocated to a room of which the rent does not exceed the agent's budget. In this scenario, we must consider not only the agents' preferences but also the capacity diversity of the rooms and the budget constraints while allocating the rooms. Therefore, this paper investigates the room allocation problem with capacity diversity and budget constraints. We mainly focus on finding an allocation that maximizes social welfare. First, this paper demonstrates that finding an allocation that maximizes the social welfare is NP-hard (i.e., non-deterministic polynomial-time hard), even if only one room's capacity is larger than 1 and the other rooms' capacities are all 1. Second, this paper presents a (c * + 2)/2 + ε-factor approximation algorithm (with ε > 0) for the case in which the capacity of each room does not exceed a constant c *. Third, this paper proposes a heuristic algorithm based on the local search for the general case in which the capacity of each room is not bounded by a constant. The experimental results demonstrate that the proposed algorithm can produce near-optimal solutions. Finally, this paper investigates how to find a roommate stable or room envyfree allocation with a social welfare guarantee. INDEX TERMS Room allocation, capacity diversity, budget constraints, algorithm design.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Room Allocation With Capacity Diversity and Budget Constraints

Liu

Jiang

et al. 2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…This thesis focus on the generalization of the online model. This section is reproduced from our published paper [ Huzhang et al, 2017 ] .…”

Section: Related Workmentioning

confidence: 99%

“…14: 1 [Bei et al, 2017a], copyright holder IJCAI's link: http://www.ijcai.org/ 2 [Huzhang et al, 2017], copyright holder IJCAI's link: http://www.ijcai.org/ 3 [Bei et al, 2018] copyright holder IJCAI's link: http://www.ijcai.org/…”

mentioning

confidence: 99%