Path independence in serial-parallel data processing
type: Item
instance of: scholarly article
title: Path independence in serial-parallel data processing
zbMATH Open document ID: 0884.68040
DOI: 10.1016/0165-4896(93)00742-D
published in: Mathematical Social Sciences
publication date: 1997-11-17T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1088438
zbMATH Keywords: data processing procedures
author: Andrej V. Malishevskij
MaRDI profile type: Publication
cites work: New problems in the general choice theory
cites work: Some aspects of the general theory of best option choice
cites work: Rationality, path independence, and the power structure
cites work: Revealed Preference Theory, Ordering and the Axiom of Sequential Path Independence
cites work: Sequential path independence and social choice
cites work: Q5331549
cites work: Path-Independent Social Choice Functions: A Further Result
cites work: Impossibility theorems without collective rationality
cites work: Democratic preference functions
cites work: Realization of Choice Functions
cites work: Rationality from a computational standpoint
cites work: Weak path independence
cites work: Information, associativity, and choice requirements
cites work: Path Independent Choices
cites work: The Sertel and van der Bellen problems
cites work: Inner semigroup extension of certain semigroup amalgams
cites work: Federations and transitive group choice
cites work: Equal or proportional division of a surplus, and other methods
cites work: Surplus-sharing methods
cites work: Path Independence, Rationality, and Social Choice
cites work: Social Choice Theory: A Re-Examination
cites work: Characterizing fidelity for reflexive choices
cites work: Choice, hull, continuity and fidelity
cites work: Synopses in the Theory of Choice
cites work: On the routewise application of choice
full work available at URL: 0165-4896(93)00742-d
OpenAlex ID: W2048440835
description: scientific article; zbMATH DE number 1088438