Choice functions on posets

DOI10.1007/S11083-022-09618-2MaRDI QIDQ6116352zbMATH OpenOpenAlexFDO

Authors Vladimir I. Danilov

Publication date 18 July 2023

Published in Order (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.11965

zbMATH Keywords

filterorder idealpath independencewell orderstable contract

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

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.

Cites work

• General theory of best variants choice: Some aspects
• Hyper-relations, choice functions, and orderings of opportunity sets
• Job Matching, Coalition Formation, and Gross Substitutes
• Matching with partially ordered contracts
• Nonmonotonic reasoning, preferential models and cumulative logics
• Path Independence, Rationality, and Social Choice
• Stable schedule matching under revealed preference.
• Stable schedule matchings
• The Stable Allocation (or Ordinal Transportation) Problem

Cited in

(3)

• Choice functions and well-orderings over the infinite binary tree
• Partial choice functions for families of finite sets
• Mathematics of Plott choice functions

This page was built for publication: Choice functions on posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6116352)