Stable cores in information graph games
From MaRDI portal
Publication:2078082
DOI10.1016/j.geb.2022.01.013zbMath1483.91026OpenAlexW4207046523MaRDI QIDQ2078082
Marina Núñez, Juan J. Vidal-Puga
Publication date: 25 February 2022
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2445/172298
Cites Work
- Characterization of the von Neumann-Morgenstern stable set in a non-cooperative model of dynamic policy-making with a persistent agenda setter
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Convex vNM-stable sets for linear production games
- Extendability and von neuman-morgenstern stability of the core
- An existence result for farsighted stable sets of games in characteristic function form
- Noncooperative foundations of stable sets in voting games
- Minimal stable sets in tournaments
- Pillage games with multiple stable sets
- Prosperty properties of TU-games
- Assignment games with stable core
- Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof
- Fair stable sets of simple games
- A characterization of vNM-stable sets for linear production games
- Farsighted stability in patent licensing: an abstract game approach
- On the core of information graph games
- Stable sets in matching problems with coalitional sovereignty and path dominance
- Von Neumann-Morgenstern solutions in the assignment market
- Cores of convex games
- The assignment game. I: The core
- Convex games and stable sets
- Stability properties of the core in a generalized assignment problem
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- Stable sets for asymmetric information economies
- The Farsighted Stable Set
This page was built for publication: Stable cores in information graph games
