An approach to distributed systems from orderings and representability

Cites Work

Representations of preference orderings
Normally preordered spaces and utilities
On the multi-utility representation of preference relations
On continuous multi-utility representations of semi-closed and closed preorders
Richter-Peleg multi-utility representations of preorders
Semiorders and a Theory of Utility Discrimination
Revealed Preference Theory
Foundational aspects of theories of measurement
Title not available (Why is that?)
Intransitive Indifference in Preference Theory: A Survey
Time, clocks, and the ordering of events in a distributed system
Utility representation of an incomplete and nontransitive preference relation
On realizable biorders and the biorder dimension of a relation
Numerical representation of semiorders
Composite measurement
FURTHER RESULTS ON THE CONTINUOUS REPRESENTABILITY OF SEMIORDERS
Continuous Representability of Interval Orders: The Topological Compatibility Setting
Continuous representability of interval orders and biorders
Utility Maximization, Choice and Preference
Distributed Computing
Real interval representations
Title not available (Why is that?)
Title not available (Why is that?)
Continuous representation of a preference relation on a connected topological space
Biorder families, valued relations, and preference modelling
Causality in physics and computation
Biorders with frontier
Title not available (Why is that?)
Continuous representations of interval orders by means of two continuous functions
Partial Representations of Orderings
Approximating SP-orders through total preorders: incomparability and transitivity through permutations
Some results on biordered structures, in particular distributed systems

This page was built for publication: An approach to distributed systems from orderings and representability

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