Von Neumann-Morgenstern hypergraphs

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.

MoreLess

Year of publication:	2025
Authors:	Vannucci, Stefano
Published in:	Games. - ISSN 2073-4336. - Vol. 16.2025, 2, p. 1-6
Publisher:	Basel : MDPI
Subject:	VNM-stable sets \| kernels \| hypergraphs \| clutters \| Sperner systems \| games

More details

Type of publication:	Article
Type of publication (narrower categories):	Article
Language:	English
Other identifiers:	10.3390/g16020017 [DOI] 1927438160 [GVK] hdl:10419/330131 [Handle]
Source:	EconStor

Persistent link: https://www.econbiz.de/10015471942