Choice functions on posets
Combinatorics
2021-09-16 v3
Abstract
In the paper we study choice functions on posets satisfying the conditions of heredity and outcast. For every well-ordered sequence of elements of poset, we define the corresponding `elementary' choice function. Every such a choice function satisfies the conditions of heredity and outcast. Inversely, every choice functions satisfying the conditions of heredity and outcast can be represented as union of several elementary choice functions. This result generalizes the Aizerman-Malishevsky theorem about structure of path-independent choice functions.
Keywords
Cite
@article{arxiv.2101.11965,
title = {Choice functions on posets},
author = {Vladimir Danilov},
journal= {arXiv preprint arXiv:2101.11965},
year = {2021}
}
Comments
9 pages