Completions for Space of Preferences

Victor V. Rozen

Authors

Victor V. Rozen Saratov State University

Abstract

A preferences structure is called a complete one if it axiom linearity satisfies. We consider a problem of completion for ordering preferences structures. In section 2 an algorithm for finding of all linear orderings of finite ordered set is given. It is shown that the indicated algorithm leads to construction of the lattice of ideals for ordered set. Further we find valuations for a number of linear orderings of ordered sets of special types. A problem of contraction of the set of linear completions for ordering preferences structures which based on a certain additional information concerning of preferences in section 4 is considered. In section 5, some examples for construction and evaluations of the number of all linear completions for ordering preferences structures are given.

Keywords:

preferences structure, ordering preferences structure, completion of preferences structure, a valuation for the number of linear completions

Downloads

Download data is not yet available.

References

Birkhoff, G. (1967). Lattice theory. Amer. Math. Soc., Coll. Publ., Vol. 25.

Rozen, V. (2011). Decision making under many quality criteria. Contribution to game theory and management, vol. 5. /Collected papers presented on the Fifth International Conference Game Theory and management-SPb.: Graduate School of Management, SPbU, 2012, p.257–267.

Rozen, V. (2013). Decision making under quality criteria (in Russian). Palmarium Academic Publishing. Saarbrucken, Deutschland.