Quality assurance remains a key topic in human computation research. Prior work indicates that independent agreement is effective for low difficulty tasks, but performs poorly for moderately difficult tasks since the majority of responses may be inaccurate. We present experimental results showing that humans are better at identifying correct answers than producing correct answers in such modera...

Since recently, rank order tournaments have become quite popular for providing incentives in employment relationships. However, the consequences of different tournament designs are widely unexplored. This paper experimentally investigates different tournament design alternatives along two dimensions: tournament size and prize structure. We find that average effort tends to increase with a highe...

A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V , i.e. a hamiltonian path. Given a tournament T , it is well known that it contains a directed hamiltonian path. In this paper, we develop the structure necessary for a tournament T to contain an arc xy that is not on any hamiltonian path. Using this structure, we give suff...

An isomorphism certificate of a labeled tournament T is a labeled subdigraph of T which together with an unlabeled copy of T allows the errorless reconstruction of T . It is shown that any tournament on n vertices contains an isomorphism certificate with at most n log2 n edges. This answers a question of Fishburn, Kim and Tetali. A score certificate of T is a labeled subdigraph of T which toget...

Each year, more than $3 billion is wagered on the NCAA Division I men’s basketball tournament. Most of that money is wagered in pools where the object is to correctly predict winners of each game, with emphasis on the last four teams remaining (the Final Four). In this paper, we present a combined logistic regression/Markov chain (LRMC) model for predicting the outcome of NCAA tournament games ...

Soft-decision decoding is a very important NP-hard problem for developers of communication systems. In this work we propose two new dual domain soft decision decoders that use compact Genetic Algorithm (cGA) with larger tournament size: the first algorithm investigates tournament selection with larger size using mutation, and the second employs higher selection pressure with randomly generated ...

Sport tournament planning becomes a complex task in the presence of heterogeneous requirements from teams, media, fans and other parties. Existing approaches to sport tournament planning often rely on precomputed tournament schemes which may be too rigid to cater for these requirements. Existing work on sport tournaments suggests a separation of the planning process into three phases. In this w...

By applying tournament analysis to the UK Unit Trusts data, the results support significant risk shifting in the family tournament; i.e. interim winning managers tend to increase their level of risk exposure more than losing managers. It also shows that the risk-adjusted returns of the winners outperform those of the losers following the risk taking, which implies that risk altering can be rega...

This paper concerns a measure of selective pressure, called "loss of diversity," that denotes the proportion of unselected individuals during the selection phase. We probabilistically calculate the expected value and variance of loss of diversity in tournament selection, truncation selection, linear ranking selection, and exponential ranking selection. From numerical results, we observe that in...

Let T be a 3-partite tournament. We say that a vertex v is −→ C3-free if v does not lie on any directed triangle of T . Let F3(T ) be the set of the −→ C3-free vertices in a 3-partite tournament and f3(T ) its cardinality. In a recent paper, it was proved that if T is a regular 3-partite tournament, then f3(T ) < n 9 , where n is the order of T . In this paper, we prove that f3(T ) ≤ n 12 . We ...