On the Stackelberg knapsack game (Q2029942)

From MaRDI portal
Revision as of 21:27, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Stackelberg knapsack game
scientific article

    Statements

    title
    On the Stackelberg knapsack game (English)
    0 references
    author
    Ulrich Pferschy
    0 references
    Gaia Nicosia
    0 references
    Andrea Pacifici
    0 references
    Joachim Schauer
    0 references
    publication date
    4 June 2021
    0 references
    zbMATH Keywords
    complexity theory
    0 references
    knapsack problem
    0 references
    Stackelberg game
    0 references
    bilevel optimization
    0 references
    cites work
    The Subset Sum game
    0 references
    Q4198056
    0 references
    Q4821303
    0 references
    Q3993418
    0 references
    Q4610958
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    91A65
    0 references
    68Q25
    0 references
    zbMATH DE Number
    7355326
    0 references
    OpenAlex ID
    W3084774800
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2029942&oldid=36686084"
    Powered by MediaWiki