Author
Listed:
- Katarína Cechlárová
(Institute of Mathematics, Faculty of Science, P. J. Safárik University, Kosice, Slovakia)
- Ágnes Cseh
(Centre for Economic and Regional Studies, Institute of Economics, Tóth Kálmán utca 4., Budapest, 1097, Hungary Hasso Plattner Institute, University of Potsdam, Potsdam, Germany)
- Author-Name:Zsuzsanna Jankó
(Department of Mathematics, University of Hamburg, Hamburg, Germany Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Budapest, Hungary)
- Author-Name:Marián Kires
(Institute of Physics, Faculty of Science, P. J. Safárik University, Kosice, Slovakia)
- Author-Name:Lukás Mino
(Center for Information Science and Information Technologies, Technology and Innovation Park, P. J. Safárik University, Kosice, Slovakia)
Abstract
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.
Suggested Citation
Katarína Cechlárová & Ágnes Cseh & Author-Name:Zsuzsanna Jankó & Author-Name:Marián Kires & Author-Name:Lukás Mino, 2020.
"A quest for a fair schedule: The Young Physicists' Tournament,"
KRTK-KTI WORKING PAPERS
2025, Institute of Economics, Centre for Economic and Regional Studies.
Handle:
RePEc:has:discpr:2025
Download full text from publisher
More about this item
Keywords
;
;
;
;
;
JEL classification:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
Statistics
Access and download statistics
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:has:discpr:2025. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Nora Horvath The email address of this maintainer does not seem to be valid anymore. Please ask Nora Horvath to update the entry or send us the correct address
(email available below). General contact details of provider: https://edirc.repec.org/data/iehashu.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.