Von Neumann–Morgenstern Hypergraphs

Stefano Vannucci ()
Additional contact information
Stefano Vannucci: Department of Economics and Statistics, University of Siena, Piazza San Francesco 7, 53100 Siena, Italy

Games, 2025, vol. 16, issue 2, 1-6

Abstract: A simple hypergraph H with vertex set X and edge set E 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.

Keywords: VNM-stable sets; kernels; hypergraphs; clutters; Sperner systems; games (search for similar items in EconPapers)
JEL-codes: C C7 C70 C71 C72 C73 (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2073-4336/16/2/17/pdf (application/pdf)
https://www.mdpi.com/2073-4336/16/2/17/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jgames:v:16:y:2025:i:2:p:17-:d:1634872

Access Statistics for this article

Games is currently edited by Ms. Susie Huang

More articles in Games from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().