Szpilrajn-type theorems in economics Athanasios Andrikopoulos
- Economics, Mathematics
The Szpilrajn “constructive type” theorem on extending binary relations, or its generalizations by Dushnik and Miller , is one of the best known theorems in social sciences and mathematical…
ON THE STRUCTURE OF GAMES AND THEIR POSETS
- Mathematics, History
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii List of Abbreviations and Symbols Used . . . . . . . . . . . . . . . . . . xiv Acknowledgements . . . . . . . . . . . .…
Szpilrajn-type theorems in economics
- Mathematics, Economics
The Szpilrajn "constructive type" theorem on extending binary relations, or its generalizations by Dushnik and Miller , is one of the best known theorems in social sciences and mathematical…
A Half-Space Approach to Order Dimension
The main result states that linear orders can almost always be replaced by half-space quasiorders in the definition of the dimension of a partially ordered set.
Measuring criteria weights by means of Dimension Theory.
- Economics, Computer Science
This paper proposes a method for evaluating those weights taking advantage of Dimension Theory, which allows the representation of the set of alternatives within a real space, provided that decision maker preferences satisfy certain consistency conditions.
On a Possible Continuous Analogue of the Szpilrajn Theorem and its Strengthening by Dushnik and Miller
It will be proved that a continuous analogue of the Szpilrajn theorem does not hold in general and necessary and in some cases necessary and sufficient conditions for a topological space to satisfy a possible continuous analogue for the Dushnik-Miller theorem will be presented.
The order dimension of divisibility
- Mathematics, Computer ScienceJ. Comb. Theory, Ser. A
A nonparametric framework for inferring orders of categorical data from category-real pairs
On difference graphs and the local dimension of posets
- MathematicsEur. J. Comb.
Race Detection in Two Dimensions
- Computer ScienceACM Trans. Parallel Comput.
It is shown that structures richer than SP graphs, namely, that of two-dimensional (2D) lattices, can also be analyzed in Θ (1) space and is generalizes prior work on structured race detection and aims to provide a deeper understanding of the interplay between structured parallelism and program analysis efficiency.