Hypergraph Formation Game

Tackseung Jun and Jeong-Yoo Kim

Hitotsubashi Journal of Economics, 2009, vol. 50, issue 2, 1-16

Abstract: We define a hypergraph by a set of associations which consist of nonexclusive two or more players. It is a generalization of a graph (or a network) in the sense that an association, the counterpart of a link in a hypergraph, connects any number of nodes, not simply a pair of nodes. We characterize the efficient hypergraphs and stable hypergraphs for the linear variable cost of associations. The efficient hypergraph is either the empty hypergraph or the grand hypergraph consisting of a single grand association. The stable hypergraph can be a grand hypergraph, a star hypergraph or a line hypergraph. If a star hypergraph is stable, it must have a singleton center. Generally, a hypergraph can be underconnected, but cannot be overconnected.

Keywords: Association; Efficiency; Hypergraph; Network; Stability (search for similar items in EconPapers)
JEL-codes: C72 (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://hermes-ir.lib.hit-u.ac.jp/hermes/ir/re/18044/HJeco0500200010.pdf

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:hit:hitjec:v:50:y:2009:i:2:p:1-16

DOI: 10.15057/18044

Access Statistics for this article

More articles in Hitotsubashi Journal of Economics from Hitotsubashi University Contact information at EDIRC.
Bibliographic data for series maintained by Digital Resources Section, Hitotsubashi University Library ().