Path independence in serial-parallel data processing

DOI10.1016/0165-4896(93)00742-DMaRDI QIDQ1372587zbMATH OpenOpenAlexFDO

Authors Andrej V. Malishevskij

Publication date 17 November 1997

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-4896(93)00742-d

zbMATH Keywords

data processing procedures

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1163872
• scientific article; zbMATH DE number 1418039
• Data dependence and its application to parallel processing
• Information, associativity, and choice requirements
• Parallel smoothing

Cites work

• scientific article; zbMATH DE number 3204690 (Why is no real title available?)
• Characterizing fidelity for reflexive choices
• Choice, hull, continuity and fidelity
• Democratic preference functions
• Equal or proportional division of a surplus, and other methods
• Federations and transitive group choice
• Impossibility theorems without collective rationality
• Information, associativity, and choice requirements
• Inner semigroup extension of certain semigroup amalgams
• New problems in the general choice theory
• On the routewise application of choice
• Path Independence, Rationality, and Social Choice
• Path Independent Choices
• Path-Independent Social Choice Functions: A Further Result
• Rationality from a computational standpoint
• Rationality, path independence, and the power structure
• Realization of Choice Functions
• Revealed Preference Theory, Ordering and the Axiom of Sequential Path Independence
• Sequential path independence and social choice
• Social Choice Theory: A Re-Examination
• Some aspects of the general theory of best option choice
• Surplus-sharing methods
• Synopses in the Theory of Choice
• The Sertel and van der Bellen problems
• Weak path independence

Cited in

(8)

• scientific article; zbMATH DE number 1418039 (Why is no real title available?)
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Surmise relations between tests -- preliminary results of the mathematical modeling
• Notions from rough set theory in a generalized dependency relation context
• Transformations of discrete closure systems
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
• Path-independence and closure operators with the anti-exchange property
• Locally complete path independent choice functions and their lattices

This page was built for publication: Path independence in serial-parallel data processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372587)