Path independence in serial-parallel data processing
From MaRDI portal
Publication:1372587
DOI10.1016/0165-4896(93)00742-DzbMath0884.68040MaRDI QIDQ1372587
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
68P05: Data structures
Related Items
The duality between the anti-exchange closure operators and the path independent choice operators on a finite set, Locally complete path independent choice functions and their lattices, Notions from rough set theory in a generalized dependency relation context, Path-independence and closure operators with the anti-exchange property, The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey, Transformations of discrete closure systems, Unnamed Item
Cites Work
- Unnamed Item
- Sequential path independence and social choice
- The Sertel and van der Bellen problems
- New problems in the general choice theory
- Equal or proportional division of a surplus, and other methods
- Characterizing fidelity for reflexive choices
- On the routewise application of choice
- Some aspects of the general theory of best option choice
- Federations and transitive group choice
- Surplus-sharing methods
- Weak path independence
- Impossibility theorems without collective rationality
- Rationality from a computational standpoint
- Democratic preference functions
- Choice, hull, continuity and fidelity
- Rationality, path independence, and the power structure
- Inner semigroup extension of certain semigroup amalgams
- Information, associativity, and choice requirements
- Revealed Preference Theory, Ordering and the Axiom of Sequential Path Independence
- Synopses in the Theory of Choice
- Path Independent Choices
- Path Independence, Rationality, and Social Choice
- Path-Independent Social Choice Functions: A Further Result
- Social Choice Theory: A Re-Examination
- Realization of Choice Functions
