Bipartite Matching for Repeated Allocation Problems

Yohai Trabelsi

Research output: Contribution to journalConference articlepeer-review

Abstract

Many applications involving the allocation of resources or tasks can be modeled as matching problems in bipartite graphs. In many of these applications, allocation is performed multiple times. An example is the allocation of classrooms to course instructors, which is done every semester. To improve their chances of being assigned, instructors may relax some of their restrictions. Another example is course and classroom assignments made for weekly workdays. In this case, however, the assignment is made multiple times at once (once for each workday of the week). Finally, in task assignment problems where resources are reusable, each resource can be assigned multiple times. We describe algorithmic solutions to some of these problems and demonstrate their effectiveness in applications such as car teleoperation, desk sharing, and classroom assignment. Finally, we discuss several directions and ideas for extending our work and solving other relevant problems.

Original languageEnglish
Pages (from-to)2928-2930
Number of pages3
JournalProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2023-May
StatePublished - 2023
Event22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023 - London, United Kingdom
Duration: 29 May 20232 Jun 2023

Bibliographical note

Publisher Copyright:
© 2023 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.

Funding

The research was supported in part by the Israeli Innovation Authority through the Andromeda consortium and by the Israel Science Foundation under grant 1958/20.

FundersFunder number
Israeli Innovation Authority through the Andromeda consortium
Israel Science Foundation1958/20

    Keywords

    • Bipartite matching
    • Resource allocation
    • Teleoperation

    Fingerprint

    Dive into the research topics of 'Bipartite Matching for Repeated Allocation Problems'. Together they form a unique fingerprint.

    Cite this