arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.02184cs.AIcs.DMmath.OC
收藏

寻求公平的时间表:青年物理学家锦标赛

A quest for a fair schedule: The Young Physicists' Tournament

P. J. Šafárik University(帕沃尔·约瑟夫·沙法里克大学);Hasso Plattner Institute, University of Potsdam(哈索·普拉特纳研究所,波茨坦大学);Institute of Economics, Centre for Economic and Regional Studies(经济研究所,经济与区域研究中心);Corvinus University of Budapest(布达佩斯考文纽斯大学)

Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kireš, Lukáš Miňo

摘要:

青年物理学家锦标赛是一项以团队为导向的科学竞赛,来自5大洲37个国家的高中生参加。比赛包括科学讨论,称为战斗。每一场比赛有三到四个团队参与,每个团队提出一个问题,同时轮流扮演演讲者、对手、评审者和观察者的角色。一些国家的规则要求每支球队提前宣布他们将在全国锦标赛上提出的3个问题。组织者的任务是选择战斗的组成,以这样一种方式,即每个团队都只提出一次其选择的每个问题,并且在一场战斗中,没有问题被提出超过一次。除了形式化这些可行性条件,在本文中,我们制定了几个额外的公平性条件的比赛时间表。我们表明,其中一些可以通过在二部图中构造合适的边着色来确保实现。为了找到公平的时间表,我们提出了整数线性规划,并测试他们的真实以及随机生成的数据。

英文摘要:

The Young Physicists Tournament is an established team-oriented scientific competition between high school students from 37 countries on 5 continents. The competition consists of scientific discussions called Fights. Three or four teams participate in each Fight, each of whom presents a problem while rotating the roles of Presenter, Opponent, Reviewer, and Observer among them. The rules of a few countries require that each team announce in advance 3 problems they will present at the national tournament. The task of the organizers is to choose the composition of Fights in such a way that each team presents each of its chosen problems exactly once and within a single Fight no problem is presented more than once. Besides formalizing these feasibility conditions, in this paper we formulate several additional fairness conditions for tournament schedules. We show that the fulfillment of some of them can be ensured by constructing suitable edge colorings in bipartite graphs. To find fair schedules, we propose integer linear programs and test them on real as well as randomly generated data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑