<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>A Decomposition Technique for Equilibrium Programming under Uncertainty</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">C.H.</mods:namePart><mods:namePart type="family">Rosa</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>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.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1996-01</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>WP-96-013</mods:publisher></mods:originInfo><mods:genre>Monograph</mods:genre></mods:mods>