Strong convexity of NTU games (Q444126): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00182-012-0330-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050574298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of Convex Games Without Side Payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on NTU convexity / 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: Q5688335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Punishment strategies make the \(\alpha\)-coalitional game ordinally convex and balanced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex games without side payments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138513 / rank
 
Normal rank

Latest revision as of 14:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Strong convexity of NTU games
scientific article

    Statements

    Identifiers