Results 1  10
of
27,030
On the Discriminative Power of Tournament Solutions
, 2014
"... Tournament solutions constitute an important class of social choice functions that only depend on the pairwise majority comparisons between alternatives. Recent analytical results have shown that several concepts with appealing axiomatic properties such as the Banks set or the minimal covering set t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Tournament solutions constitute an important class of social choice functions that only depend on the pairwise majority comparisons between alternatives. Recent analytical results have shown that several concepts with appealing axiomatic properties such as the Banks set or the minimal covering set
Extending Tournament Solutions
, 2014
"... An important subclass of social choice functions, socalled majoritarian (or C1) functions, only take into account the pairwise majority relation between alternatives. In the absence of majority ties—e.g., when there is an odd number of agents with linear preferences—the majority relation is antis ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
of the commonly considered properties from its underlying tournament solution. 1
Bounds on the Disparity and Separation of Tournament Solutions
"... A tournament solution is a function that maps a tournament, i.e., a directed graph representing an asymmetric and complete relation on a finite set of alternatives, to a nonempty subset of the alternatives. Tournament solutions play an important role in social choice theory, where the binary relati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A tournament solution is a function that maps a tournament, i.e., a directed graph representing an asymmetric and complete relation on a finite set of alternatives, to a nonempty subset of the alternatives. Tournament solutions play an important role in social choice theory, where the binary
PseudoRationalizability and Tournament Solutions”, Working
, 1997
"... The theory of choice has given us a full understanding of how rationality, formulated as the maximization of a fixed binary relation, is reflected in regularities exhibited by choices from a variable feasible set. In the literature on tournaments, solutions are often constructed to pick the maxima ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The theory of choice has given us a full understanding of how rationality, formulated as the maximization of a fixed binary relation, is reflected in regularities exhibited by choices from a variable feasible set. In the literature on tournaments, solutions are often constructed to pick
PageRank as a Weak Tournament Solution
, 2007
"... We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a wellstudied area of social choice theory—are strongly related. This relationship permits a mutual transfer of axioms and solutio ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a wellstudied area of social choice theory—are strongly related. This relationship permits a mutual transfer of axioms
On the FixedParameter Tractability of CompositionConsistent Tournament Solutions
, 2010
"... Tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a nonempty subset of the alternatives, play an important role within social choice theory and the mathematical social sciences at large. Laffond et al. have shown that various to ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a nonempty subset of the alternatives, play an important role within social choice theory and the mathematical social sciences at large. Laffond et al. have shown that various
A comparative analysis of selection schemes used in genetic algorithms
 Foundations of Genetic Algorithms
, 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract

Cited by 512 (32 self)
 Add to MetaCart
This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference
Ranking from Stochastic Pairwise Preferences: Recovering Condorcet Winners and Tournament Solution Sets at the Top
"... We consider the problem of ranking n items from stochastically sampled pairwise preferences. It was shown recently that when the underlying pairwise preferences are acyclic, several algorithms including the Rank Centrality algorithm, the Matrix Borda algorithm, and the SVMRankAggregation algorithm ..."
Abstract
 Add to MetaCart
. For example, if a Condorcet winner exists that beats every other item, it is natural to ask that this be ranked at the top. More generally, several tournament solution concepts such as the top cycle, Copeland set, Markov set and others have been proposed in the social choice literature for choosing a
A Fast Elitist NonDominated Sorting Genetic Algorithm for MultiObjective Optimization: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) 4 computational complexity (where is the number of objectives and is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing ..."
Abstract

Cited by 634 (15 self)
 Add to MetaCart
complexity is presented. Second, a selection operator is presented which creates a mating pool by combining the parent and child populations and selecting the best (with respect to fitness and spread) solutions. Simulation results on five difficult test problems show that the proposed NSGAII is able
Results 1  10
of
27,030