Utilizing housing resources for homeless youth through the lens of multiple multi-dimensional knapsacks

Chan, Hau, Tran-Thanh, Long, Wilder, Bryan, Rice, Eric, Vayanos, Phebe and Tambe, Milind (2018) Utilizing housing resources for homeless youth through the lens of multiple multi-dimensional knapsacks. In AIES 2018 - Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society. Association for Computing Machinery. pp. 41-47 . (doi:10.1145/3278721.3278757).

Abstract

There are over 1 million homeless youth in the U.S. each year. To reduce homelessness, U.S. Housing and Urban Development (HUD) and housing communities provide housing programs/services to homeless youth with the goal of improving their long-term situation. Housing communities are facing a difficult task of filling their housing programs, with as many youths as possible, subject to resource constraints for meeting the needs of youth. Currently, the assignment is manually done by humans working in the housing communities. In this paper, we consider the problem of assigning homeless youth to housing programs subject to resource constraints. We provide an initial abstract model for this setting and show that the problem of maximizing the total assigned youth to the programs under this model is APX-hard. To solve the problem, we non-trivially formulate it as a multiple multi-dimensional knapsack problem (MMDKP), which is not known to have any approximation algorithm. We provide a first interpretable and easy-to-use greedy algorithm with logarithmic approximation ratio for solving general MMDKP. We conduct experiments on random and realistic instances of the housing assignment settings and show that our algorithm is efficient and effective in solving large instances (up to 1 million youth).

This record has no associated files available for download.

Contributors

Author: Long Tran-Thanh

Download statistics