Bipartite Matching for Repeated Allocation Problems
International Conference on Autonomous Agents and Multiagent Systems(2023)
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.
MoreTranslated text
求助PDF
上传PDF
View via Publisher
AI Read Science
AI Summary
AI Summary is the key point extracted automatically understanding the full text of the paper, including the background, methods, results, conclusions, icons and other key content, so that you can get the outline of the paper at a glance.
Example
Background
Key content
Introduction
Methods
Results
Related work
Fund
Key content
- Pretraining has recently greatly promoted the development of natural language processing (NLP)
- We show that M6 outperforms the baselines in multimodal downstream tasks, and the large M6 with 10 parameters can reach a better performance
- We propose a method called M6 that is able to process information of multiple modalities and perform both single-modal and cross-modal understanding and generation
- The model is scaled to large model with 10 billion parameters with sophisticated deployment, and the 10 -parameter M6-large is the largest pretrained model in Chinese
- Experimental results show that our proposed M6 outperforms the baseline in a number of downstream tasks concerning both single modality and multiple modalities We will continue the pretraining of extremely large models by increasing data to explore the limit of its performance
Upload PDF to Generate Summary
Must-Reading Tree
Example

Generate MRT to find the research sequence of this paper
Related Papers
2010
被引用8 | 浏览
2020
被引用20 | 浏览
2020
被引用40 | 浏览
2022
被引用3 | 浏览
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
GPU is busy, summary generation fails
Rerequest