Showing papers on "Tournament published in 2001"

Method and apparatus for gaming machines with a tournament play bonus feature

Abstract: A gaming method and device includes a game, at least one non-qualifying outcome in the game, and at least one qualifying outcome in the game, wherein a player qualifies for a multi-player tournament to be held in the future when the player achieves the at least one qualifying outcome.

Physiological and performance responses to tournament wrestling

Abstract: KRAEMER, W. J., A. C. FRY, M. R. RUBIN, T. TRIPLETT-MCBRIDE, S. E. GORDON, L. P. KOZIRIS, J. M. LYNCH, J. S. VOLEK, D. E. MEUFFELS, R. U. NEWTON, and S. J. FLECK. Physiological and performance responses to tournament wrestling. Med. Sci. Sports Exerc., Vol. 33, No. 8, 2001, pp. 1367–1378.PurposeThe

Corporate tournaments and executive compensation: Evidence from the U.K.

Abstract: This study tests the implications of tournament theory using data on 100 U.K. stock market companies, covering over 500 individual executives, in the late 1990s. Our results provide some evidence consistent with the operation of tournament mechanisms within the U.K. business context. Firstly, we find a convex relationship between executive pay and organizational level and secondly, that the gap between CEO pay and other board executives (i.e., tournament prize) is positively related to the number of participants in the tournament. However, we also show that the variation in executive team pay has little role in determining company performance.

Computer assisted poker tournament

Abstract: A computer assisted poker tournament is conformed for computer network display where observers can view various virtual poker tables and decide if they want to participate at this table Upon deciding to participate the observer pays an entry fee, is given a corresponding number of virtual playing chips and then can bet these chips over the network Now as a participant the network player can elect to withdraw from the tournament for any desired period of time and may re-enter any virtual tournament table that has openings in it At a specified time the participant's total winnings are compared against those of other players to determine the tournament winner

Executive Pay in Japan: The Role of Bank-Appointed Monitors and the Main Bank Relationship

Abstract: The tournament model has the feature that executive compensation depends on the wages paid to workers at lower levels of the corporate hierarchy. The agency model shows that compensation based on firm performance is a means by which incentives can be provided to executives once a promotion tournament has been resolved. In this paper, we combine aspects of both models and show that the existence of an outsider who monitors the firm's activities will lower the sensitivity of pay to firm performance for top executives and reduce the importance of tournament-based incentives. Using panel data for 56 Japanese electronics firms, we find support for the notion that bank-appointed Board members help monitor top executives and that tournament considerations are a particularly important feature of executive compensation in Japan.

Minimizing the effects of chance

Abstract: A method for providing a tournament system over a communications network enables players from different locations to participate in tournaments by playing an electronic games of skill and win awards based on the player's skill. A selection of electronic games of skill, in which the effect of chance has been minimized for each electronic game, is provided at a tournament host location. Players can participate in a selected tournament by playing the electronic game for that tournament via the communications network. Each player's score is determined based on player manipulation of the electronic game. A tournament winner is determined by comparing the score of each player with scores of other players.

A comparative tournament analysis between the EURO 1996 and 2000 in soccer

Abstract: In international tournaments, teams are judged on their ability to win matches. Behind the wins, the teams must have effective ways to win the ball, create successful attacks first to reach the att...

Rank-Order Tournaments and Selection

Abstract: Rank-order tournaments are often presented as devices for aligning incentives in a principal-agent setting. In most of this literature agents are expected to be identical so that the principal is indifferent ex ante as to who wins the contest, implying that the selection properties of the tournament can be ignored. In this paper we consider a tournament which is not necessarily symmetric, and in which agent type is private information. The principal cares about who wins, but the basic tournament will not achieve perfect selection; the lower-type agent may sometimes win. In a two-player tournament we present a simple reward system in which the winner's reward depends upon which (if any) of two “test standards” is passed; conditions are presented under which this system allows the principal to choose the best agent. This system can be extended in a simple manner to rank types in ann-player tournament. We suggest that the theory can be applied to internal labor markets and research contests.

A Note on the Complexity of the Reachability Problem for Tournaments

Abstract: Deciding whether a vertex in a graph is reachable from another vertex has been studied intensively in complexity theory and is well understood. For common types of graphs like directed graphs, undirected graphs, dags or trees it takes a (possibly nondeterministic) logspace machine to decide the reachability problem, and the succinct versions of these problems (which often arise in hardware design) are all PSPACEcomplete. In this paper we study tournaments, which are directed graphs with exactly one edge between any two vertices. We show that the tournament reachability problem is first order definable and that its succinct version is Π2 -complete.

Interactive real time computer processed golf tournament system

Abstract: A method for playing an interactive computer processed golf tournament in real time via the Internet. The method includes the steps of registering users via the Internet and storing the user name, address, age, telephone, credit card data and club number on a library file. The method includes scheduling named tournaments, registering users via the Internet as contestants in one of the named tournaments including, assigning the user a position within a flight of a first round of the named tournament, and storing the assigned position on the library file. Participating contestant logins are accepted via the Internet prior to each named tournament. Participating contestants are provided with a scorecard display for the assigned flight including a tournament name, a countdown clock, one or more contestant scores, a cursor, and a message area. User inputs are accepted in real time via the Internet from each of the participating contestants in turn for each of the holes wherein each input determines a random score for the hole. A winner of each of the flights is determined based on a total of the random scores. Each winner is assigned to a position in a successive flight in a successive round and the process is repeated until the last championship round. Playing a championship round includes determining a plurality of championship round winners based on the random scores and awarding prizes to the championship round winners.

On the maximum number of Hamiltonian paths in tournaments

Abstract: Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament onn vertices is at mostc · n3/2· n!/2n−1, wherec is a positive constant independent ofn.

Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments

Abstract: Ao and Hanson, and Guiduli, Gyarfas, Thomasse and Weidl independently, proved the following result: For any tournament score sequence S = (s1, s2,…,sn) with s1≤s2 ≤ … ≤ sn, there exists a tournament T on vertex set {1,2, …, n} such that the score of each vertex i is si and the sub-tournaments of T on both the even and the odd indexed vertices are transitive in the given order; that is, i dominates j whenever i > j and i a j (mod 2). In this note, we give a much shorter proof of the result. In the course of doing so, we show that the score sequence of a tournament satisfies a set of inequalities which are individually stronger than the well-known set of inequalities of Landau, but collectively the two sets of inequalities are equivalent. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 244254, 2001

Identifying the NCAA tournament dance card

Abstract: The NCAA Basketball Tournament selection committee annually selects the Division I men's teams that should receive at-large bids to the national championship tournament. Although its deliberations are shrouded in secrecy, the committee is supposed to consider a litany of team-performance statistics, many of which outsiders can reasonably estimate. Using a probit analysis on objective team data from 1994 through 1999, we developed an equation that accurately classified nearly 90 percent of 249 "bubble" teams during that time frame and over 85 percent for the 2000 tournament. Given the NCAA Tournament's nickname of the big dance, the equation is effectively the "dance card" that determined whether a team got an invitation from past committees and is also a tool that could aid decision making for future committees. The accuracy of the dance card, and the factors and weights included in it, suggest that the committee is fairly predictable in its decisions, despite barbs from fans, teams, and the media.

The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs

Abstract: A balanced tournament design of order n, BTD(n), defined on a 2n-set V , is an arrangement of the ( 2n 2 ) distinct unordered pairs of elements of V into an n× (2n−1) array such that (1) every element of V occurs exactly once in each column and (2) every element of V occurs at most twice in each row. We will show that there exists a BTD(n) for n a positive integer, n = 2. For n = 2, a BTD(n) does not exist. If the BTD(n) has the additional property that it is possible to permute the columns of the array such that for every row, all the elements of V appear exactly once in the first n pairs of that row and exactly once in the last n pairs of that row then we call the design a partitioned balanced tournament design, PBTD(n). We will show that there exists a PBTD(n) for n a positive integer, n ≥ 5, except possibly for n ∈ {9, 11, 15}. For n ≤ 4 a PBTD(n) does not exist.

Vertex pancyclic in-tournaments

Abstract: An in-tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. The topic of this paper is to investigate vertex k-pancyclicity of in-tournaments of order n, where for some 3 ≤ k ≤ n, every vertex belongs to a cycle of length p for every k ≤ p ≤ n. We give sharp lower bounds for the minimum degree such that a strong in-tournament is vertex k-pancyclic for k ≤ 5 and k ≥ n - 3. In the latter case, we even show that the in-tournaments in consideration are fully (n - 3)-extendable which means that every vertex belongs to a cycle of length n - 3 and that the vertex set of every cycle of length at least n - 3 is contained in a cycle of length one greater. In accordance with these results, we state the conjecture that every strong in-tournament of order n with minimum degree greater than ${{9(n-k-1)}\over{5+6k+(-1)^k2^{-k+2}}}+1$ is vertex k-pancyclic for 5 < k < n - 3, and we present a family of examples showing that this bound would be best possible. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 84–104, 2001

New table-tennis rating system

Abstract: Summary. We present a new system for rating the playing strength of table-tennis players. The system is based on Bayesian principles and is designed to handle a large changing population of players, where some players play frequently whereas other players play infrequently. The system takes into account the length of time since a player last played a tournament. When processing matches in a single tournament, the system takes into account how a player’s opponents did in the same tournament. The system has been tested by processing data from 5½ years of tournaments (15549 players and 330079 matches). The system could be adapted to other sports that involve head-to-head competition.

Evolution in Knockout Contests: the Variable Strategy Case

Abstract: In a previous paper we introduced a model of a multi-player conflict in the form of a knockout tournament. Groups of individuals resolved their disputes in a tournament in which in each round the remaining contestants formed pairs who competed against each other: in such a contest between two individuals using behaviours x and y there was a probability that each would win, and a cost incurred by the loser, both of which depended on x and y. The winner pro- gressed to the next round of the tournament and the loser was eliminated; a player received a reward which depended on how far that individual progressed. Individuals were constrained to adopt a fixed play throughout the tournament. In this paper we extend the model by allowing individuals to vary their choice of behaviour from round to round. The complexity of such systems is investigated and illustrated by both special cases and numerical examples. It is shown that in this case behaviour is very different to the fixed strategy case.

Method for automatically opening a game rally on the computer system

Abstract: PURPOSE: A method for automatically holding a game tournament in a computer system capable of accessing through a communication network is provided to reduce manpower and expenses for holding a game tournament by performing whole process including a project of the game tournament on line through a game tournament operation server. CONSTITUTION: A platform based on a game tournament is constructed in a game holding server computer(S100). The expenses for proceeding and operating the game tournament is paid (S200). An electronic publicity board is installed in a publicity page. The game tournament is publicized(S300). Applications for participating in the game tournament of a plurality of gamers are accepted(S400). A competition table is made out on the basis of a tournament, a league and a mixed type(S500). The game tournament is executed according to the competition table(S600).

The domination number of a tournament

Abstract: We find bounds for the domination number of a tour- nament and investigate the sharpness of these bounds. We also find the domination number of a random tournament.

Mixed size tournament selection

Abstract: In genetic algorithms, tournament schemes are often applied as selection operators. The advantage are simplicity and efficiency. On the other hand, major deficiencies related to tournament selection are the coarse scaling of the selection pressure and the poor sampling accuracy. We introduce a new variant of tournament selection which provides an adjustable probability distribution, a fine-tuning facility for the selection pressure and an improved sampling accuracy at the cost of a minimal increase of the complexity and with almost no loss of efficiency.

Method for conducting a golf tournament

Abstract: A method for conducting a golf tournament is provided. The method includes positioning a plurality of players at a minimum of two separate tee areas and starting the play at each of the tee areas approximately simultaneously. A first round of golf is coordinated among the plurality of players and a group of finalists is selected from the plurality of players after the completion of the first round. A final round of golf is conducted among the group of finalists. A corresponding method of increasing revenue generated from a golf tournament is also provided.

A Simulation model for soccer championships

Abstract: In this paper we discuss a simulation/probability model that identifies the team that is most likely to win a tournament. The model can also be used to answer other questions like 'which team had a lucky draw?' or 'what is the probability that two teams meet at some moment in the tournament?'. Input to the model are scoring intensities, that are estimated as a weighted average of goals scored. The model has been used in practice to write articles for the popular press, and seems to perform well. Keywords: Soccer, Poisson models, simulation

Electronic dart game machine with integrated tournament mode

Abstract: An electronic dart game machine (100) with an integrated tournament mode includes a first target (104), a processor (202) coupled to the first target (104), and a display (108) coupled to the processor (202). A memory (204) connected to the processor (202) stores automated software instructions (300). In particular, the instructions (300) accept player identifications, determine a tournament mode (e.g., single elimination mode or double elimination mode), and create and display a tournament chart (Figures 6-9) including paired player identifications, including BYEs (Figures 6, 7 and 9). The instructions further accept a tournament game selection that specifies a dart game to be played during the dart tournament. Subsequently, the instructions initiate dart game matches in accordance with the paired player identifications in the tournament chart (Figures 6-9), monitor darts striking the first electronic dart target to determine a match winner for each dart game match, and create an updated tournament chart to include new paired player identifications indicative of match winners (Figure 9). When the dart tournament is completed, the instructions display a player identification ranking on the display (Figure 10).

Outpaths of arcs in multipartite tournaments

Abstract: Ak-outpath of an arcxy in a multipartite tournament is a directed path with lengthk starting fromxy such thatx does not dominate the end vertex of the directed path. This concept is a generalization of a directed cycle. We show that ifT is an almost regularn-partite (n≥8) tournament with each partite set having at least two vertices, then every arc ofT has ak-outpath for allk, 3≤k≤n−1.

Imbalance in tournament designs

Abstract: We introduce two measures of imbalance, the team imbalance, and the field imbalance, in a tournament design. In addition to an exhaustive study of imbalances in tournament designs with up to eight teams, we present some bounds on the imbalances, as well as recursive construc­ tions for homogeneous tournaments.

Choice Using Cyclic Tournament Relations

Abstract: A new (so-called matched) tournament solution is constructed as a restriction of the well-known Fishburn–Miller set. The options are chosen by applying the Copeland method to a certain collection of subsets of the presentation set that contain at most four elements. The main properties of the matched tournament solution are illustrated with examples. A condition is derived on the choice function identifying the class of matched solutions.