Related papers: How to Choose a Champion
Consider the problem: we are given $n$ boxes, labeled $\{1,2,\ldots, n\}$ by an adversary, each containing a single number chosen from an unknown distribution; these $n$ distributions are not necessarily identical. We are also given an…
Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…
Given a random variable $O \in \mathbb{R}$ and a set of experts $E$, we describe a method for finding a subset of experts $S \subseteq E$ whose aggregated opinion best predicts the outcome of $O$. Therefore, the problem can be regarded as a…
The main challenge of combinatorial game theory is to handle combinatorial chaos, if one player knows the strategy better than his opponent, he is able to determine the exact results of a game. If both players are qualified competitor, the…
When voter preferences are known in an incomplete (partial) manner, winner determination is commonly treated as the identification of the necessary and possible winners; these are the candidates who win in all completions or at least one…
Indian Premier League (IPL) is a tournament of twenty over cricket matches. Teams of this tournament are selected via an auction from a pool of players. Each team employs a think-tank to build the best possible team. Few studies have been…
We introduce the dueling teams problem, a new online-learning setting in which the learner observes noisy comparisons of disjoint pairs of $k$-sized teams from a universe of $n$ players. The goal of the learner is to minimize the number of…
A random walk-like model is considered to discuss statistical aspects of tournaments. The model is applied to soccer leagues with emphasis on the scores. This competitive system was computationally simulated and the results are compared…
Despite the many recent practical and theoretical breakthroughs in computational game theory, equilibrium finding in extensive-form team games remains a significant challenge. While NP-hard in the worst case, there are provably efficient…
A tournament on $n$ agents is a complete oriented graph with the agents as vertices and edges that describe the win-loss outcomes of the $\binom{n}{2}$ matches played between each pair of agents. The winner of a tournament is determined by…
The most important factors which contribute to the efficiency of game-theoretical algorithms are time and game complexity. In this study, we have offered an elegant method to deal with high complexity of game theoretic multi-objective…
Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter…
Consider an important meeting to be held in a team-based organization. Taking availability constraints into account, an online scheduling poll is being used in order to decide upon the exact time of the meeting. Decisions are to be taken…
We study the dynamics and resulting score distribution of three-agent games where after each competition a single agent wins and scores a point. A single competition is described by a triplet of numbers $p$, $t$ and $q$ denoting the…
Elo rating systems measure the approximate skill of each competitor in a game or sport. A competitor's rating increases when they win and decreases when they lose. Increasing one's rating can be difficult work; one must hone their skills…
In this work author applies well known web search algorithm Hyperlink - Induced Topic Search (HITS) to problem of ranking football teams in English Premier League (EPL). The algorithm allows the ranking of the teams using the notions of…
Collaborative competitions have gained popularity in the scientific and technological fields. These competitions involve defining tasks, selecting evaluation scores, and devising result verification methods. In the standard scenario,…
Tanking, the act of deliberately dropping points or losing a game in order to gain some other advantage, is usually seen as being against the spirit of sports. It can be even more serious if playing a draw is a (weakly) dominant strategy…
In this paper we show a new technique to analyze families of rankings. In particular we focus on sports rankings and, more precisely, on soccer leagues. We consider that two teams compete when they change their relative positions in…
We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…