Solving oligopolistic equilibrium problems with convex optimization (Q2301931)

From MaRDI portal
Revision as of 21:50, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Solving oligopolistic equilibrium problems with convex optimization
scientific article

    Statements

    title
    Solving oligopolistic equilibrium problems with convex optimization (English)
    0 references
    author
    Ruud Egging-Bratseth
    0 references
    Tobias Baltensperger
    0 references
    Asgeir Tomasgard
    0 references
    publication date
    25 February 2020
    0 references
    zbMATH Keywords
    convex programming
    0 references
    partial equilibrium problems
    0 references
    complementarity problems
    0 references
    Cournot oligopoly
    0 references
    conjectural variation
    0 references
    describes a project that uses
    PATH Solver
    0 references
    CPLEX
    0 references
    GAMS
    0 references
    KNITRO
    0 references
    cites work
    Q5395226
    0 references
    Q4309474
    0 references
    Potential games
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C33
    0 references
    90C15
    0 references
    90C25
    0 references
    91B54
    0 references
    91B76
    0 references
    zbMATH DE Number
    7173698
    0 references
    OpenAlex ID
    W3004023973
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2301931&oldid=38996959"
    Powered by MediaWiki