Now showing items 1-3 of 3
A note on numerical representations of quasi-transitive binary relations
A Binary relation is said to be quasi-transitive if its asymmetric part is transitive. A binary relation is said to be a weak-order if it is reflexive, complete and transitive. One may refer to Frensh  for a synopsis ...
Some solutions for abstract games: axiomatic characterisations
In this paper we consider binary relations which are reflexive and complete. Such binary relations are referred to in the literature as abstract games. Given an abstract game a (game) solution is a function which associates ...
Lexicographic composition of abstract games
In this paper we begin by obtaining a necessary and sufficient condition for a quasi transitive binary relation to be transitive. Then we obtain necessary and sufficient conditions for the lexicographic composition of two ...