Results 251 to 260 of about 68,433 (283)
Some of the next articles are maybe not open access.
The random tournament as a Cayley tournament
Aequationes Mathematicae, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaligot, Eric, Khelif, Anatole
exaly +3 more sources
Economics Letters, 2014 A standard tournament contract specifies only tournament prizes. If agents’ performance is measured on a cardinal scale, the principal can complement the tournament contract by a gap which defines the minimum distance by which the best performing agent must beat the second best to receive the winner prize.
Imhof, Lorens, Kräkel, Matthias
openaire +3 more sources
Combinatorica, 1991
Let \(f(n)\) denote the least integer \(N\) such that every tournament with \(N\) nodes contains every oriented tree with \(n\) nodes. The authors show that \(f(n)\leq 12n\) and \(f(n)\leq(4+o(1))n\).
Roland Häggkvist, Andrew Thomason 0001
openaire +1 more source
Let \(f(n)\) denote the least integer \(N\) such that every tournament with \(N\) nodes contains every oriented tree with \(n\) nodes. The authors show that \(f(n)\leq 12n\) and \(f(n)\leq(4+o(1))n\).
Roland Häggkvist, Andrew Thomason 0001
openaire +1 more source
Canadian Mathematical Bulletin, 1964
By a tournament we mean the outcome of a round-robin tournament in which there are no draws. Such a tournament may be represented by a graph in which the n players are represented by vertices labelled 1, 2, …, n, and the outcomes of the games are represented by directed edges so that every pair of vertices is joined by one directed edge. We call such a
Erdős, Pál, Moser, L.
openaire +2 more sources
By a tournament we mean the outcome of a round-robin tournament in which there are no draws. Such a tournament may be represented by a graph in which the n players are represented by vertices labelled 1, 2, …, n, and the outcomes of the games are represented by directed edges so that every pair of vertices is joined by one directed edge. We call such a
Erdős, Pál, Moser, L.
openaire +2 more sources
Economica, 1996
This paper explores the incentive effects of a renewal clause in a lease. The basis of selection is rank-order performance. The authors' findings, in the context of a principal-agent model, are as follows. In order to extract greater effort from tenants (i.e., agents), the landlord (the principal) must commit to a reward scheme that provides a part of ...
Banerji, Sanjay, Rashid, Salim
openaire +1 more source
This paper explores the incentive effects of a renewal clause in a lease. The basis of selection is rank-order performance. The authors' findings, in the context of a principal-agent model, are as follows. In order to extract greater effort from tenants (i.e., agents), the landlord (the principal) must commit to a reward scheme that provides a part of ...
Banerji, Sanjay, Rashid, Salim
openaire +1 more source
On Subtournaments of a Tournament
Canadian Mathematical Bulletin, 1966Beineke and Harary [l] recently showed that the maximum number of strong tournaments with k nodes that can be contained in a tournament with n nodes isif 3 ≤ k ≤ n. The object of this note is to obtain some additional results of this type. We will use essentially the same terminology as was used in [ l ], so we will not repeat the standard definitions ...
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 2006
A tournament is an oriented complete graph. The feedback arc set problem for tournaments is the optimization problem of determining the minimum possible number of edges of a given input tournament T whose reversal makes T acyclic. Ailon, Charikar, and Newman showed that this problem is NP-hard under randomized reductions.
openaire +2 more sources
A tournament is an oriented complete graph. The feedback arc set problem for tournaments is the optimization problem of determining the minimum possible number of edges of a given input tournament T whose reversal makes T acyclic. Ailon, Charikar, and Newman showed that this problem is NP-hard under randomized reductions.
openaire +2 more sources
Proceedings of the AAAI Conference on Artificial Intelligence, 2010
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u can beat v in the game. (If an edge (u, v) is not present, one cannot match u and v.) Given G and a "favorite" node A, is it possible to set up the bracket of a ...
openaire +1 more source
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u can beat v in the game. (If an edge (u, v) is not present, one cannot match u and v.) Given G and a "favorite" node A, is it possible to set up the bracket of a ...
openaire +1 more source
Journal of Algorithms, 1997
Summary: A tournament \(T_n\) is an orientation of the complete graph on \(n\) vertices. We continue the algorithmic study initiated by \textit{P. Hell} and \textit{M. Rosenfeld} [J. Algorithms 4, 303-309 (1983; Zbl 0532.68069)] of recognizing various directed trees in tournaments.
R. Balasubramanian +2 more
openaire +3 more sources
Summary: A tournament \(T_n\) is an orientation of the complete graph on \(n\) vertices. We continue the algorithmic study initiated by \textit{P. Hell} and \textit{M. Rosenfeld} [J. Algorithms 4, 303-309 (1983; Zbl 0532.68069)] of recognizing various directed trees in tournaments.
R. Balasubramanian +2 more
openaire +3 more sources
Journal of Labor Economics, 2001
This study examines aspects of pay and promotion in corporate hierarchies in the context of tournament theory. Evidence supports the tournament perspective in that most positions are filled through promotion and pay rises strongly with hierarchical level. Furthermore, the winner's prize in the CEO tournament increases with the number of competitors for
openaire +1 more source
This study examines aspects of pay and promotion in corporate hierarchies in the context of tournament theory. Evidence supports the tournament perspective in that most positions are filled through promotion and pay rises strongly with hierarchical level. Furthermore, the winner's prize in the CEO tournament increases with the number of competitors for
openaire +1 more source