相关论文: Scheduling Asynchronous Round-Robin Tournaments
A \emph{fair competition}, based on the concept of envy-freeness, is a non-eliminating competition where each contestant (team or individual player) may not play against all other contestants, but the total difficulty for each contestant is…
Parallel machine scheduling has been extensively studied in the past decades, with applications ranging from production planning to job processing in large computing clusters. In this work we study some of these fundamental optimization…
Reid conjectured that any finite set of non-negative integers is the score set of some tournament and Yao gave a non-constructive proof of Reid's conjecture using arithmetic arguments. No constructive proof has been found since. In this…
In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong players, where the scores take values in $[0,\,1]$.
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling…
In a prediction tournament, contestants "forecast" by asserting a numerical probability for each of (say) 100 future real-world events. The scoring system is designed so that (regardless of the unknown true probabilities) more accurate…
Motivated by settings such as medical treatments or aircraft maintenance, we consider a scheduling problem with jobs that consist of two operations, a test and a processing part. The time required to execute the test is known in advance…
We study synchronous values of games, especially synchronous games. It is known that a synchronous game has a perfect strategy if and only if it has a perfect synchronous strategy. However, we give examples of synchronous games, in…
In the current work we introduce a novel estimation of distribution algorithm to tackle a hard combinatorial optimization problem, namely the single-machine scheduling problem, with uncertain delivery times. The majority of the existing…
A cycle C={v_1,v_2,....,v_1} in a tournament T is said to be even, if when walking along C, an even number of edges point in the wrong direction, that is, they are directed from v_{i+1} to v_i. In this short paper, we show that for every…
This paper examines multiplayer symmetric constant-sum games with more than two players in a competitive setting, including examples like Mahjong, Poker, and various board and video games. In contrast to two-player zero-sum games,…
I study symmetric competitions in which each player chooses an arbitrary distribution over a one-dimensional performance index, subject to a convex cost. I establish existence of a symmetric equilibrium, document various properties it must…
We study tournaments where winning a rank-dependent prize requires passing a minimum performance standard. We show that, for any prize allocation, the optimal standard is always at a mode of performance that is weakly higher than the global…
We consider a natural scheduling problem which arises in many distributed computing frameworks. Jobs with diverse resource requirements (e.g. memory requirements) arrive over time and must be served by a cluster of servers, each with a…
We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is associated with a subset of vertices --- matches as many of…
We consider non-preemptive scheduling of MapReduce jobs with multiple tasks in the practical scenario where each job requires several map-reduce rounds. We seek to minimize the average weighted completion time and consider scheduling on…
Scheduling university courses is extra challenging when classroom capacities are reduced because of social distancing requirements that are implemented in response to a pandemic such as COVID-19. In this work, we propose an expanded…
Many sports leagues are played in a tightly scheduled round-robin format, leaving a limited time window to postpone matches. If the season cannot resume due to an external shock such as the coronavirus pandemic in 2020, the ranking of the…
The time ordering of two spacelike separated events is arbitrary, when all inertial frames are taken into account, but for three or more events it is not generally so. We determine the structure of possible time orderings, or chronologies,…
In this work, we consider a scheduling problem faced by production companies with large electricity consumption. Due to the contract with the electric utility, the production companies are obligated to comply with the total energy…