A score certificate for a tournament, T , is a collection of arcs of T which can be uniquely completed to a tournament with the same scorelist as T ’s, and the score certificate number of T is the least number of arcs in a score certificate of T . Upper bounds on the score certificate number of upset tournaments are derived. The upset tournaments on n vertices are in one–to–one correspondence w...

A tournament is a simultaneous n-player game built on top of a symmetric two-player game G. Each player chooses one action in G and is matched to play G against each of the other n − 1 players. His score in each match is his G-payoff. The winner of the tournament is the player who achieves the highest total score (ties are broken randomly). The tournament has several interpretations as an evolu...

We begin with a cautionary tale. In 2012, the Olympics were held in London. One of the biggest scandals of the event concerned, of all sports, women’s badminton. The scandal did not involve any failed drug tests, but rather a failed tournament design that did not consider carefully incentives. The tournament design used is familiar from the World Cup. There are four groups (A,B,C,D) of four tea...

The increasing attention paid in recent years to the annual NCAA men s basketball tour nament seems due at least in part to the proliferation of o ce pools which follow tournament outcomes Such pools typically assign a point value to each game in the tournament the winner of the pool is then the person who amasses the most points Picking the winner of each indi vidual game can be done using a v...

In this paper, we study (1, 2)-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the (1, 2)-step competition graph of a bipartite tournament has at most one non-trivial component or consists of exactly two complete components of size at least three and, especially in the former, the diameter of the nontrivia...

Tournament selection is one of the most commonly used parent selection schemes in Genetic Programming (GP). While it has a number of advantages over other selection schemes, it still has some issues that need to be thoroughly investigated. Two of the issues are assocated with the sampling process from the population into the tournament. The first one is the socalled “multi-sampled” issue, where...

The round-robin tournament format for N players is a scheme that matches players with one another in all possible N(N − 1)/2 pairwise comparisons. A noisy round-robin tournament adds to the particular matching scheme performance fluctuations of the participating players, or noise. With noise, upsets become possible and hence the possibility that the ex ante best player is not the winner ex post...

The third World Baseball Classic (WBC) was held in March 2013. In this tournament, 16 teams play in Round 1 under a round-robin (RR) format and 8 teams which advanced to Round 2 play under a modified double-elimination (MDE) format. This 2013 WBC format is compared with the formats such as the past two WBCs held in 2006 and 2009, from the aspect of the probability of winning the tournament and ...

This paper describes the strategies used by AstonCAT-Plus, the post-tournament version of the specialist designed for the TAC Market Design Tournament 2010. It details how AstonCATPlus accepts shouts, clears market, sets transaction prices and charges fees. Through empirical evaluation, we show that AstonCAT-Plus not only outperforms AstonCAT (tournament version) significantly but also achieves...

A convex subset of vertices of a tournament T is such that any vertex not in the subset either dominates or is dominated by all of the vertices in the convex subset. Given a large tournament T , we explore the structure of T by looking for its transitive convex subsets. In a majority voting tournament some isolated inconsistencies may appear in such subsets. We propose a way to reveal such “nea...