Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = Sperner systems

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
6 pages, 190 KiB  
Article
Von Neumann–Morgenstern Hypergraphs
by Stefano Vannucci
Games 2025, 16(2), 17; https://doi.org/10.3390/g16020017 - 15 Apr 2025
Viewed by 491
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 [...] Read more.
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. Full article
Back to TopTop