Results 1  10
of
7,495
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5350 (67 self)
 Add to MetaCart
was the exploration of variations around a point, within the bounds imposed by the constraints, in order to help characterize solutions and portray them in terms of ‘variational principles’. Notions of perturbation, approximation and even generalized differentiability were extensively investigated. Variational theory
Classification of Wetlands and Deepwater Habitats of the United States
 FWS/OBS79/31. USDI, U.S. Fish and Wildlife Service, Office of Biological Service. 103
, 1979
"... This classification, to be used in a new inventory of wetlands and deepwater habitats of the United States, is intended to describe ecological taxa, arrange them in a system useful to resource managers, furnish units for mapping, and provide uniformity of concepts and terms. Wetlands are defined by ..."
Abstract

Cited by 395 (1 self)
 Add to MetaCart
This classification, to be used in a new inventory of wetlands and deepwater habitats of the United States, is intended to describe ecological taxa, arrange them in a system useful to resource managers, furnish units for mapping, and provide uniformity of concepts and terms. Wetlands are defined
What memory is for
 Behavioral and Brain Sciences
, 1997
"... What working memory is for Citation for published version: Logie, RH 1997, 'What working memory is for ' Behavioral and Brain Sciences, vol 20, no. 1, pp. 28. Link: Link to publication record in Edinburgh Research Explorer ..."
Abstract

Cited by 379 (5 self)
 Add to MetaCart
What working memory is for Citation for published version: Logie, RH 1997, 'What working memory is for ' Behavioral and Brain Sciences, vol 20, no. 1, pp. 28. Link: Link to publication record in Edinburgh Research Explorer
Minimal Stable Sets in Tournaments
, 2009
"... We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, which encompasses the top cycle, the uncove ..."
Abstract

Cited by 17 (12 self)
 Add to MetaCart
, the uncovered set, the Banks set, the minimal covering set, the tournament equilibrium set, the Copeland set, and the bipartisan set. Moreover, the hierarchy includes a new tournament solution, the minimal extending set, which is conjectured to refine both the minimal covering set and the Banks set. 1
Minimal Retentive Sets in Tournaments
, 2009
"... Many problems in multiagent decision making can be addressed using tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a nonempty subset of the alternatives. For a given tournament solution S, Schwartz calls a set of alternatives ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Many problems in multiagent decision making can be addressed using tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a nonempty subset of the alternatives. For a given tournament solution S, Schwartz calls a set of alternatives
Introduction to the special issue on word sense disambiguation
 Computational Linguistics J
, 1998
"... ..."
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
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
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
symmetric and complete and can thus conveniently be represented by a tournament. Tournaments have a rich mathematical theory and many formal results for majoritarian functions assume that the majority relation constitutes a tournament. Moreover, most majoritarian functions have only been defined for tournaments
Results 1  10
of
7,495