학술논문
Fair scheduling mechanism for an ordering of preferences over slot of time / 時間帯に希望順序を持つ場合の公平なスケジューリングメカニズムの提案
Document Type
Journal Article
Author
Source
Proceedings of the Annual Conference of JSAI. 2023, :1
Subject
Language
Japanese
ISSN
2758-7347
Abstract
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.