Results 1  10
of
222
Ranking systems: The PageRank axioms
 In EC ’05: Proceedings of the 6th ACM conference on Electronic commerce
, 2005
"... This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic ecommerce and Internet Technologies. In order to understand the essence and the exact rationale of page ranking algorithms we suggest the axiomatic approach taken in the formal theory of social ch ..."
Abstract

Cited by 42 (8 self)
 Add to MetaCart
choice. In this paper we deal with PageRank, the most famous page ranking algorithm. We present a set of simple (graphtheoretic, ordinal) axioms that are satisfied by PageRank, and moreover any page ranking algorithm that does satisfy them must coincide with PageRank. This is the first representation
Ranking the Linear Correspondence Axiom
"... The overarching question addressed here is how syntactic structures based on constituency (dominance, ccommand) are to be mapped onto linear phonetic strings. I argue that both prosodic principles and narrowsyntactic principles play a role in the linearization of syntactic structures. I take Kayne ..."
Abstract
 Add to MetaCart
Kayne’s (1994) Linear Correspondence Axiom as a starting point: (asymmetric) ccommand maps onto precedence relations. Two wideranging predictions of Kayne’s theory are that specifiers precede their heads and that a head can only have one specifier or adjunct. Although abundant evidence supports
Risk, Ambiguity, and the RankDependence Axioms
, 2009
"... Choice problems in the spirit of Ellsberg (1961) suggest that rankdependent (“Choquet expected utility”) preferences over subjective gambles might be subject to the same difficulties that Ellsberg’s earlier examples posed for subjective expected utility. These difficulties stem from eventseparabil ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Choice problems in the spirit of Ellsberg (1961) suggest that rankdependent (“Choquet expected utility”) preferences over subjective gambles might be subject to the same difficulties that Ellsberg’s earlier examples posed for subjective expected utility. These difficulties stem from event
The choice axiom after twenty years
 Journal of Mathematical Psychology
, 1977
"... This survey is divided into three major sections. The first concerns mathematical results about the choice axiom and the choice models that devoIve from it. For example, its relationship to Thurstonian theory is satisfyingly understood; much is known about how choice and ranking probabilities may re ..."
Abstract

Cited by 80 (0 self)
 Add to MetaCart
This survey is divided into three major sections. The first concerns mathematical results about the choice axiom and the choice models that devoIve from it. For example, its relationship to Thurstonian theory is satisfyingly understood; much is known about how choice and ranking probabilities may
Ontology Inconsistency Handling: Ranking and Rewriting Axioms
"... Abstract. Ontology reasoners are able to detect inconsistencies in ontologies; however, there is relatively limited support for resolving the problems. Existing approaches either pinpoint axioms which are responsible for inconsistencies or calculate maximal consistent/coherent subontologies of inco ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
for ranking and rewriting axioms in ontologies, so as to provide users with guidelines on how to achieve a consistent/coherent ontology. We implement these methods in a prototype system, aiming at enabling nonexpert users to resolve inconsistencies. 1
Axioms for infinite matroids
"... We give axiomatic foundations for nonfinitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966. ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
We give axiomatic foundations for nonfinitary infinite matroids with duality, in terms of independent sets, bases, circuits, closure and rank. This completes the solution to a problem of Rado of 1966.
FRANZ HUBER The Consistency Argument for Ranking Functions
"... Abstract. The paper provides an argument for the thesis that an agent’s degrees of disbelief should obey the ranking calculus. This Consistency Argument is based on the Consistency Theorem, which says that an entrenchment function gives rise to consistent and deductively closed beliefs iff it satisf ..."
Abstract
 Add to MetaCart
it satisfies the ranking axioms. The Consistency Argument is extended to various ranktheoretic update rules.
On the missing axiom of Quantum Mechanics
"... Abstract. The debate on the nature of quantum probabilities in relation to Quantum Non Locality has elevated Quantum Mechanics to the level of an Operational Epistemic Theory. In such context the quantum superposition principle has an extraneous non epistemic nature. This leads us to seek purely ope ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
operational foundations for Quantum Mechanics, from which to derive the current mathematical axiomatization based on Hilbert spaces. In the present work I present a set of axioms of purely operational nature, based on a general definition of "the experiment", the operational/epistemic archetype
ANO Anonymity axiom ARM Axiom of Revealed MetaPreferences
, 2011
"... This paper explores the possibility of defining a non nonutilitarian utilitarian normative standard for assessments of welfare and deprivation. The paper contributes to this end in three ways. First, the paper formalises a key aspect of Prof. Sen’s critique of the assumption tion of consistent util ..."
Abstract
 Add to MetaCart
utility maximisation in the revealed preference theory. Secondly, the paper explores alternative formulations of the axiom of revealed preferences that are consistent with Prof. Sen’s critique and proposes a set of intuitive assumptions to characterise the relation between observed choices and underlying
Results 1  10
of
222