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 17 of 17 for “"Equilibrium Computation"”.

  1. EQUILIBRIUM COMPUTATION IN INCOMPLETE FINANCIAL MARKETS WITH HETEROGENEOUS AGENTS

    This thesis studies general equilibrium in an incomplete market where access to a risky asset is restricted. I consider a continuous-time economy with two heterogeneous CRRA agents and two risky assets, one of which is exclusively accessible to a single agent. A stochastic process for the relative …

    nus Repository record for EQUILIBRIUM COMPUTATION IN INCOMPLETE FINANCIAL MARKETS WITH HETEROGENEOUS AGENTS (opens in a new tab) Download file for EQUILIBRIUM COMPUTATION IN INCOMPLETE FINANCIAL MARKETS WITH HETEROGENEOUS AGENTS (opens in a new tab)

  2. Equilibrium computation in games and strategic aspects of bitcoin mining

    … on one hand we study the query complexity of equilibrium computation in games, and on the other hand, we use equilibrium concepts from game theory as a tool to understand miner incentives in Bitcoin. In terms of query complexity, we mostly focus on algorithms that have access to utility …

    oxford Repository record for Equilibrium computation in games and strategic aspects of bitcoin mining (opens in a new tab)

  3. Mechanism design, social choice and equilibrium computation in restricted domains

    … aspect of algorithmic game theory, that of equilibrium computation, where we study the complexity of computing a Pure Nash Equilibrium in linear weighted congestion games and also show an efficient algorithm for computing approximate equilibria in a natural subclass of Max-Cut games (ICALP …

    greece Repository record for Mechanism design, social choice and equilibrium computation in restricted domains (opens in a new tab)

  4. Computing approximate Nash equilibria

    … proved that every finite game has at least one equilibrium (so-called Nash equilibrium), the natural question arose whether we can compute one efficiently. After several years of extensive research, we now know that the problem of finding a Nash equilibrium is PPAD-complete even for two-player …

    greece Repository record for Computing approximate Nash equilibria (opens in a new tab)

  5. Karma games: A decentralized, efficient and fair resource allocation scheme

    … of the new notion of the stationary Nash equilibrium, which is guaranteed to exist. An equivalency between dynamic population games and classical population games is established, which we utilize to adapt evolutionary dynamics for equilibrium computation. A numerical analysis of the karma …

    ethz Repository record for Karma games: A decentralized, efficient and fair resource allocation scheme (opens in a new tab)

  6. Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation

    … optimization, even deciding whether a pure Nash equilibrium (PNE) exists is computationally intractable in general. The unifying thesis is that the equilibrium of such a game is a computable and leverageable object around which better system-level decisions can be built, and this idea is …

    vt Repository record for Multi-Agent Integer Programming Games with Non-Cooperation and Cooperation (opens in a new tab)

  7. Search and optimization with randomness in computational economics: equilibria, pricing, and decisions

    … we study search and optimization problems from computational economics with primarily stochastic inputs. The results are grouped into two categories: First, we address the smoothed analysis of Nash equilibrium computation. Second, we address two pricing problems in mechanism design, and solve …

    uiuc Repository record for Search and optimization with randomness in computational economics: equilibria, pricing, and decisions (opens in a new tab)

  8. Accuracy-aware privacy mechanisms for distributed computation

    … distributed optimization problems, (b) computing equilibrium of network aggregate games, and (c) solving a distributed system of linear equations. Specifically, we propose a privacy definition for distributed computation ""non-identifiability"", that allow us to simultaneously guarantee privacy …

    uiuc Repository record for Accuracy-aware privacy mechanisms for distributed computation (opens in a new tab)

  9. Algorithms for fair division through competitive equilibrium

    … While many fairness notions exist, competitive equilibrium (CE) is often the most preferred as it satisfies multiple other fairness properties simultaneously. The approach creates a fictitious market for the items by endowing agents with virtual currency. In an equilibrium, aggregate demand …

    uiuc Repository record for Algorithms for fair division through competitive equilibrium (opens in a new tab)

  10. Pricing and resource allocation in edge computing

    … the proposed framework generates a market equilibrium solution that not only maximizes the edge resource utilization but also allocates favorite resource bundles to the services given their budget constraints. We show that the equilibrium allocation is Pareto-optimal and satisfies desired …

    ubc Repository record for Pricing and resource allocation in edge computing (opens in a new tab) Download PDF for Pricing and resource allocation in edge computing (opens in a new tab)

  11. Essays on market dynamics, regulation and advertising.

    … the chapter uses a new concept of Oblivious Equilibrium to handle intractable state space and accelerate equilibrium computation. Chapter 2 studies how advertising influences firms' incentives to invest in R&D. The link between advertising and industry innovation is important, not only …

    umn Repository record for Essays on market dynamics, regulation and advertising. (opens in a new tab)

  12. Structural results for total search complexity classes with applications to game theory and optimisation

    … and NASH (given a game, compute a mixed Nash equilibrium). In order to shed light on the complexity of these problems, researchers have attempted to classify them in various subclasses of TFNP such as PPAD, PPA, PPP, PLS, and CLS. A celebrated result in this line of research is the …

    oxford Repository record for Structural results for total search complexity classes with applications to game theory and optimisation (opens in a new tab)

  13. Essays on Economics and Computer Science

    … The second, and primary, chapter considers the computational aspects of tenable strategy sets. I characterize these set-valued solution concepts using the more familiar framework of perturbed strategies, introduce strong alternatives to the problems of verifying whether a strategy block …

    cornell Repository record for Essays on Economics and Computer Science (opens in a new tab)

  14. Modeling Asphaltene Precipitation and Implementation of Group Contribution Equation of State Into Utcomp

    … contribution equation-of-state for the phase equilibrium calculations in reservoir simulations. Asphaltene precipitation is a serious problem in oil recovery, and it may damage the oil production. Many models have been developed to predict the asphaltene precipitation behavior. In this study, …

    texas Repository record for Modeling Asphaltene Precipitation and Implementation of Group Contribution Equation of State Into Utcomp (opens in a new tab) Restricted access

  15. Enhancements to Transportation Analysis and Simulation Systems

    … to a large-scale network. The current user equilibrium computation in TRANSIMS involves simply an iterative process between the Route Planner and the MicroSimulator modules. In the first run, the Route Planner uses free-flow speeds on each link to estimate the travel time to find the …

    vt Repository record for Enhancements to Transportation Analysis and Simulation Systems (opens in a new tab)

  16. Nástroj pro výpočet Nashova ekvilibria v nekooperativních hrách s nenulovým součtem

    Tato práce se zabývá popisem vývoje nástroje pro výpočet Nashova ekvilibria v nekooperativních hrách s nenulovým součtem. Definuje základní pojmy v teorii nekooperativních her. Popisuje vhodné algoritmy pro výpočet ryzího a smíšeného Nashova ekvilibria podle počtu hráčů dané hry. Práce prezentuje …

    brno-tech Repository record for Nástroj pro výpočet Nashova ekvilibria v nekooperativních hrách s nenulovým součtem (opens in a new tab)

  17. Efficient Learning in Team Games: A coordination-competition dilemma

    L'abstract è presente nell'allegato / the abstract is in the attachment

    poli-torino Repository record for Efficient Learning in Team Games: A coordination-competition dilemma (opens in a new tab)