| Display title | Path independence in serial-parallel data processing |
| Default sort key | Path independence in serial-parallel data processing |
| Page length (in bytes) | 15 |
| Namespace ID | 0 |
| Page ID | 9245234 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Page views in the past month | 0 |
| MaRDI portal item ID | None |
| Central description | scientific article; zbMATH DE number 1088438 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Import240129110113 (talk | contribs) |
| Date of page creation | 16:06, 31 January 2024 |
| Latest editor | AllProfilePages260409040437 (talk | contribs) |
| Date of latest edit | 03:51, 13 April 2026 |
| Total number of edits | 2 |
| Recent number of edits (within past 90 days) | 1 |
| Recent number of distinct authors | 1 |
| Transcluded templates (17) | Pages included on this page:
|
| MaRDI portal entities used in this page | - zbMATH Keywords
- Miscellaneous (e.g. entity existence)
- Label: en
- published in
- Miscellaneous (e.g. entity existence)
- Label: en
- full work available at URL
- Miscellaneous (e.g. entity existence)
- Label: en
- Mathematics Subject Classification ID
- Miscellaneous (e.g. entity existence)
- Label: en
- publication date
- Miscellaneous (e.g. entity existence)
- Label: en
- The Sertel and van der Bellen problems
- New problems in the general choice theory
- Equal or proportional division of a surplus, and other methods
- Data dependence and its application to parallel processing
- Characterizing fidelity for reflexive choices
- Andrej V. Malishevskij
- 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
- Path independence in serial-parallel data processing
- Title
- Miscellaneous (e.g. entity existence)
- Label: en
- Sitelink
- Some statements
- Notions from rough set theory in a generalized dependency relation context
- Path-independence and closure operators with the anti-exchange property
- Mathematical Social Sciences
- Rationality, path independence, and the power structure
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Inner semigroup extension of certain semigroup amalgams
- Transformations of discrete closure systems
- Information, associativity, and choice requirements
- Surmise relations between tests -- preliminary results of the mathematical modeling
- 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
- Q4395495
- Q4944308
- Q5331549
- 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
- Parallel smoothing
- Sequential path independence and social choice
|
