On<i>n</i>-person game solutions and convex programs with essentially unconstrained duals<sup>1</sup> (Q3790979): 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.1080/02331938808843319 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970394048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the formation of unions in \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complements, mollifiers and the propensity to disrupt / 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: Q5817873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A production problem and computation of the N-core using coverings / rank
 
Normal rank

Latest revision as of 16:41, 18 June 2024

scientific article
Language Label Description Also known as
English
On<i>n</i>-person game solutions and convex programs with essentially unconstrained duals<sup>1</sup>
scientific article

    Statements

    On<i>n</i>-person game solutions and convex programs with essentially unconstrained duals<sup>1</sup> (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    unconstrained duals
    0 references
    Charles-Kortanek convex nucleus solutions
    0 references
    entropic solutions
    0 references

    Identifiers