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 8 of 8 for “"Equilibrium computation"”.

  1. Computing Economic Equilibria and Their Applications to Market Games

    … science to ensure an implementation that is both computationally efficient and improves social welfare. There has been significant research in the field of computer science concerning the computation of economic equilibria, specifically Nash Equilibria and Correlated Equilibria. These algorithms, …

    mit Repository record for Computing Economic Equilibria and Their Applications to Market Games (opens in a new tab)

  2. Computing Equilibria in Colonel Blotto by Applying Counterfactual Regret Minimization Using a Layered Graph Representation

    Equilibrium computation of games is one of the fundamental problems at the intersection of computer science and economics. Many popular games have been solved to superhuman levels with a variety of learning techniques, such as diplomacy, many different variants of poker, and most notably, chess. In …

    mit Repository record for Computing Equilibria in Colonel Blotto by Applying Counterfactual Regret Minimization Using a Layered Graph Representation (opens in a new tab)

  3. 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)

  4. 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)

  5. 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)

  6. 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)

  7. 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)

  8. 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)