Fair scheduling mechanism for an ordering of preferences over slot of time
-
- ITAKURA Reiji
- Nagoya Institute of Techinology
-
- SAKURAI Yuko
- Nagoya Institute of Techinology
Bibliographic Information
- Other Title
-
- 時間帯に希望順序を持つ場合の公平なスケジューリングメカニズムの提案
Abstract
<p>We develop an fair and strategy-proof scheduling mechanism when an agent has an ordering of preference of slot of time. The scheduling problem is known as an application of cake-cutting problem which is to fairly allocate a divisible goods among agents. We formalize a scheduling problem as a cake-cutting problem and then propose an fair and strategy-proof scheduling mechanism. We also evaluate the efficiency obtained the proposed mechanism using computational simulations.</p>
Journal
-
- Proceedings of the Annual Conference of JSAI
-
Proceedings of the Annual Conference of JSAI JSAI2023 (0), 1F5GS505-1F5GS505, 2023
The Japanese Society for Artificial Intelligence
- Tweet
Details 詳細情報について
-
- CRID
- 1390296808221009664
-
- ISSN
- 27587347
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
-
- Abstract License Flag
- Disallowed