Abstract
The paper puts forth a theory of choice functions in a neat way connecting it to a theory of extensive operators and neighborhood systems. We consider classes of heritage choice functions satisfying conditions M, N, W, and C, or combinations of these conditions. In terms of extensive operators these classes can be considered as generalizations of symmetric, anti-symmetric and transitive binary relations. Among these classes we meet the well-known classes of matroids and convex geometries. Using a ‘topological’ language we discuss these classes of monotone extensive operators (or heritage choice functions) in terms of neighborhood systems. A remarkable inversion on the set of choice functions is introduced. Restricted to the class of heritage choice functions the inversion turns out to be an involution, and under this involution the axiom N is auto-inverse, whereas the axioms W and M change places.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aigner, M.: Combinatorial Theory. Springer, Berlin (1979)
Aizerman, M.A., Aleskerov, F.T.: Theory of Choice. North Holland, Amsterdam (1995)
Aizerman, M.A., Zavalishin, N.V., Pyatnitsky, Ye.S.: Global functions of sets in the theory of alternative selection. Avtom. Telemeh. 38(3), 11–125 (1977)
Ando, K.: Extreme point axioms for closure spaces. Discrete Math. 303, 3181–3188 (2006)
Caspard, N., Monjardet, B.: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey. Discrete Appl. Math. 127(2), 241–269 (2003)
Danilov, V., Koshevoy, G.: Mathematics of Plott choice functions. Math. Soc. Sci. 49, 245–272 (2005)
Demetrovics, J., Hencsey, G., Libkin, L., Muchnik, I.: On the interaction between closure operations and choice functions with applications to relational databases. Acta Cybern. 10(Nr.3), 129–139 (1992)
Echenique, F.: Counting combinatorial choice rules. Games Econ. Behav. 58, 231–245 (2007)
Edelman, P.H.: Abstract convexity and meet-distribunive lattices. Contemp. Math. 57, 127–149 (1986)
Johnson, M.R., Dean, R.A.: Locally complete path independent choice functions and their lattices. Math. Soc. Sci. 42, 53–87 (2001)
Koshevoy, G.A.: Choice functions and abstract convex geometries. Math. Soc. Sci. 38, 35–44 (1999)
Litvakov, B.M.: Choice mechanisms using graph-multiple structures. Avtom. Telemeh. 9, 145–152 (1980)
Mirkin, B., Muchnik, I.: Induced layered clusters, hereditary mappings, and convex geometries. Appl. Math. Lett. 15, 293–298 (2002)
Monjardet, B., Raderanirina, V.: Lattices of choice functions and consensus problems. Soc. Choice Welf. 23, 349–382 (2004)
Moulin, H.: Choice functions over a finite sets: a summery. Soc. Choice Welf. 2, 147-160 (1985)
Muchnik, I., Shwartser, L.: Maximization of generalized characteristic of functions of monotone systems. Avtom. Telemeh. 51, 1562–1572 (1990)
Nehring, K.: Rational choice and revealed preference without binariness. Soc. Choice Welf. 14, 403–425 (1997)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported in part by NWO–RFBR grant 047.011.2004.017, by RFBR grant 05-01-02805 CNRSL_a, and the grant NSh-929.2008.6, School Support. We want to thank B. Monjardet, the editor and a referee for discussions and useful suggestions.
Rights and permissions
About this article
Cite this article
Danilov, V., Koshevoy, G. Choice Functions and Extensive Operators. Order 26, 69–94 (2009). https://doi.org/10.1007/s11083-009-9108-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-009-9108-x