Properties of 1-convex \(n\)-person games (Q1061621): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel of a cooperative game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3661353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inequalities that determine the bargaining set \({\mathcal M}_ 1^ {(1)}\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization, existence proof and dimension bounds for the kernel of a game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure of the Kernel of a Cooperative Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The kernel and bargaining set for convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative games with large cores / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01719757 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044694679 / rank
 
Normal rank

Latest revision as of 08:30, 30 July 2024

scientific article
Language Label Description Also known as
English
Properties of 1-convex \(n\)-person games
scientific article

    Statements

    Properties of 1-convex \(n\)-person games (English)
    0 references
    0 references
    1985
    0 references
    The subclass of 1-convex \(n\)-person games is central in this paper. It turns out that a 1-convex \(n\)-person game can be characterized by the structure of the core and that its nucleolus lies in the center of gravity of the core. Using the formula for the nucleolus, it is shown that for 1-convex games the intersection of the (pre-)kernel with the core consists of a unique point. Nevertheless, the (pre-)kernel may contain points outside the core. Hence, the bargaining set of a 1-convex \(n\)-person game not necessarily coincides with the core and the part of the bargaining set outside the core may even be disconnected with the core. Furthermore, the class of 1-convex games which possess a ``large'' core, is classified.
    0 references
    1-convex \(n\)-person games
    0 references
    core
    0 references
    nucleolus
    0 references
    center of gravity
    0 references
    kernel
    0 references
    bargaining set
    0 references

    Identifiers