Solving oligopolistic equilibrium problems with convex optimization (Q2301931): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
Import241208061232 (talk | contribs)
1,083,878 edits
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2020.01.025 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2020.01.025 / rank
 
Normal rank

Latest revision as of 21:50, 17 December 2024

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