In the present paper, we propose a new approach on ‘distributed systems’: the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations met in various fields (such as computer science, economics and decision theory). We investigate questions associated to the numerical representability of order structures, relating concepts of economics and computing to each other. The concept of ‘quasi-finite partial orders’ is introduced as a finite family of chains with a communication between them. The representability of this kind of structure is studied, achieving a construction method for a finite (continuous) Richter–Peleg multi-utility representation.
An Approach to Distributed Systems from Orderings and Representability
Published 2024 in Bulletin of the Iranian Mathematical Society
ABSTRACT
PUBLICATION RECORD
- Publication year
2024
- Venue
Bulletin of the Iranian Mathematical Society
- Publication date
2024-04-08
- Fields of study
Not labeled
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-37 of 37 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1