Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/330131 
Year of Publication: 
2025
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Volume:] 16 [Issue:] 2 [Article No.:] 17 [Year:] 2025 [Pages:] 1-6
Publisher: 
MDPI, Basel
Abstract: 
A simple hypergraph H with vertex set X and edge set 𝐄 is representable by Von Neumann-Morgenstern (VNM)-stable sets - or VNM - if there exists an irreflexive simple digraph D with vertex set X such that each edge of H is a VNM-stable set of D. It is shown that a simple hypergraph H is VNM if and only if each edge of H is a maximal clique of the conjugation graph of H. A related algorithm that identifies finite VNM hypergraphs is also provided.
Subjects: 
VNM-stable sets
kernels
hypergraphs
clutters
Sperner systems
games
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.