von Neumann–Morgenstern stable sets of a patent licensing game: The existence proof

Toshiyuki Hirai and Naoki Watanabe

Mathematical Social Sciences, 2018, vol. 94, issue C, 1-12

Abstract: This paper provides the existence proof for stable sets of a game which may have empty cores. Given the number of licensees of a patented technology which is determined by the patent holder without any production facilities, a game with a coalition structure is formulated with the outcome expected in the subsequent market competition where any cartels are prohibited. Although the core is non-empty if and only if the grand coalition is formed with a condition, we provide, for each permissible coalition structure, the sufficient condition(s) for the existence of von Neumann–Morgenstern stable sets of the game. Under symmetric imputations, there exist stable sets for any permissible coalition structures, and each of those is completely characterized.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489618300258
Full text for ScienceDirect subscribers only

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:eee:matsoc:v:94:y:2018:i:c:p:1-12

DOI: 10.1016/j.mathsocsci.2018.04.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().