A KKM-result and an application for binary and non-binary choice functions (Q1865174): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q701894
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00199-001-0242-y / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Duncan J. Melville / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00199-001-0242-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1486524867 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00199-001-0242-Y / rank
 
Normal rank

Latest revision as of 10:43, 16 December 2024

scientific article
Language Label Description Also known as
English
A KKM-result and an application for binary and non-binary choice functions
scientific article

    Statements

    A KKM-result and an application for binary and non-binary choice functions (English)
    0 references
    0 references
    0 references
    0 references
    25 March 2003
    0 references
    The KKM theorem gives a sufficient condition for the intersection of a finite family of closed subsets of \(\mathbb R^n\) to be non-empty. The authors generalize this result to subsets of a class of topological spaces, called \(L\)-spaces. A generalized KKM-correspondence from a topological space \(Y\) to an \(L\)-space \(X\) is one that respects the \(L\)-structure on \(X\). Theorem 1 provides the generalization of the KKM theorem to this context. The authors then apply the result to obtain a condition on the existence of maximal elements for binary choice functions and a non-emptiness condition for non-binary choice functions.
    0 references
    KKM theorem
    0 references
    non-empty choice
    0 references
    non-binary choice function
    0 references
    maximal elements
    0 references
    tournaments
    0 references

    Identifiers