Tournaments and Multiple Productive Inputs: The Case of Performance Enhancing Drugs In this paper I consider the desirability of drugs that enhance cognitive abilities in the context of tournaments that are used as optimal labor contracts as in Lazear and Rosen (1981). Such drugs reduce the number of voluntary participants in a tournament, but increase individual and total output. If the tourna...

—We studied the initial mortality of black bass Micropterus spp. that were captured, weighed in, and released in fishing tournaments conducted by the Bass Anglers Sportsman Society between 1972 and 1998. Mean annual initial mortality (i.e., mortality before weigh-in and release) ranged from 1% to 30%. Initial mortality was greatest during the 1970s (15.2%) and decreased during the 1980s (5.7%) ...

In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-andbound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithm...

In 1995, Stiebitz [13] asked the following question: For any positive integers s, t, is there a finite integer f(s, t) such that every digraph D with minimum out-degree at least f(s, t) admits a bipartition (A,B) such that A induces a subdigraph with minimum out-degree at least s and B induces a subdigraph with minimum out-degree at least t? We give an affirmative answer for tournaments, bipart...

Tournaments: There Is More Than Meets the Eye By the well established tournament literature, incomplete information regarding the employees’ productivity is essential for the rationalization of (efficiency-enhancing) tournaments. In this paper we propose an alternative rationalization of tournaments focusing on a fully informed principal whose objective is to maximize a weighted average of the ...

As computerized agents are becoming more and more common, e-commerce becomes a major candidate for incorporation of automated agents. Thus, it is vital to understand how people design agents for online markets and how their design changes over time. This, in turn, will enable better design of agents for these environments. We focus on the design of trading agents for bilateral negotiations with...

As computerized agents have become more and more common, e-commerce has become a major candidate for incorporation of automated agents. Thus, it is vital to understand how people design agents for online markets and how their design changes over time. This, in turn, will enable a better design of agents for these environments. We focus on the design of trading agents for bilateral negotiations ...

OBJECTIVES To investigate the incidence, site, and nature of injuries sustained in amateur rugby league sevens tournaments. METHODS A total of 168 players competing in three amateur rugby league sevens tournaments were studied. All injuries sustained during matches were recorded. Information recorded included the name of the injured player and the time, cause, anatomical site, and nature of t...

A recent paper computes near-optimal strategies for twoplayer no-limit Texas hold’em tournaments; however, the techniques used are unable to compute equilibrium strategies for tournaments with more than two players. Motivated by the widespread popularity of multiplayer tournaments and the observation that jam/fold strategies are nearoptimal in the two player case, we develop an algorithm that c...

We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures. We show that, under some axioms, a unique decomposition tree exists for umodules. Polynomial-time algorithms are provided for: non-trivial umodule test, maximal umodule computation, and decomposition tree computation ...