A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura) (Q422368): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00182-011-0291-9 / rank
Normal rank
 
Property / author
 
Property / author: Josep Maria Izquierdo / rank
Normal rank
 
Property / author
 
Property / author: Josep Maria Izquierdo / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91B26 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6035635 / rank
 
Normal rank
Property / zbMATH Keywords
 
convex games
Property / zbMATH Keywords: convex games / rank
 
Normal rank
Property / zbMATH Keywords
 
bargaining set
Property / zbMATH Keywords: bargaining set / rank
 
Normal rank
Property / zbMATH Keywords
 
core
Property / zbMATH Keywords: core / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00182-011-0291-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030361769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of stable payoff configurations for cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel of a cooperative game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex games and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence between bargaining sets and the core in simple games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sensitivity of von Neumann and Morgenstern abstract stable sets: The stable and the individual stable bargaining set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of convex games by means of bargaining sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equivalence theorem for a bargaining set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the Theory of Cooperative Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cores of cooperative games and the stability of the Weber set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-cores in bargaining sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theorem for a bargaining set / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00182-011-0291-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:04, 9 December 2024

scientific article
Language Label Description Also known as
English
A characterization of convex TU games by means of the Mas-Colell bargaining set (à la Shimomura)
scientific article

    Statements

    Identifiers