A Decomposition Technique for Equilibrium Programming under Uncertainty
We consider a decomposition technique for solving monotone stochastic Nash equilibrium models based on scenarios and policy aggregation. The algorithm works by splitting the large multi-scenario equilibrium programming problem into separable scenario equilibrium subproblems that are amenable to solution via mixed complementarity problem solvers. We will consider preliminary numerical experience on a small stochastic trade model with two agents, two goods, and two scenarios.
|Date of creation:||Jan 1996|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp96013. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.