Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"FIXP"”.

  1. Combinatorial and exchange markets: Algorithms, complexity, and applications

    … and submodular minimization. Next, we show FIXP-hardness of computing equilibria in Arrow-Debreu exchange markets under Leontief utility functions, and Arrow-Debreu markets under linear utility functions and Leontief production sets, thereby settling these open questions of Vazirani and …

    gatech Repository record for Combinatorial and exchange markets: Algorithms, complexity, and applications (opens in a new tab)

  2. Derivative-Based Financial Network Clearing: Transition From Intractability to Computable Solutions

    … the exact computation version of the problem is FIXP-complete. We infer FIXPa-completeness for finding a strongly (or “near”) approximate solution as a direct consequence.<br/><br/><div><div>• <b><i>Approximation Strength</i></b>: We establish an improved explicit inapproximability bound for …

    kings Repository record for Derivative-Based Financial Network Clearing: Transition From Intractability to Computable Solutions (opens in a new tab) Download PDF for Derivative-Based Financial Network Clearing: Transition From Intractability to Computable Solutions (opens in a new tab)

  3. Prospect Theory Preferences in Noncooperative Game Theory

    The present work seeks to incorporate a popular descriptive, empirically grounded model of human preference under risk, prospect theory, into the equilibrium theory of noncooperative games. Three primary, candidate definitions are systematically identified on the basis of classical …

    vcu Repository record for Prospect Theory Preferences in Noncooperative Game Theory (opens in a new tab)