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 18 of 18 for “"price of anarchy"”.

  1. Price of anarchy in a Bertrand oligopoly market

    The price of anarchy quantifies the inefficiency that occurs in the total system objective in the user optimization as compared to the system optimization setting. It is well known that this inefficiency occurs due to lack of coordination among the competitors in the system. In this thesis, we …

    mit Repository record for Price of anarchy in a Bertrand oligopoly market (opens in a new tab)

  2. Price of anarchy in supply chains, congested systems and joint ventures

    This thesis studies the price of anarchy in supply chains, congested systems and joint ventures. It consists of three main parts. In the first part, we investigate the impact of imperfect competition with nonlinear demand. We focus on a distribution channel with a single supplier and multiple …

    mit Repository record for Price of anarchy in supply chains, congested systems and joint ventures (opens in a new tab)

  3. On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks

    We study the influence of information design on routing in the presence of vagaries, following the canonical congestion game approach. We allow a central controller to observe nature's state and make exploit the information gap between her and the drivers, to cater information to drivers in a most …

    uiuc Repository record for On the role of signaling in mitigation of road-traffic congestion: The price of anarchy of signaling-based strategies in stochastic networks (opens in a new tab)

  4. Network flow problems and congestion games : complexity and approximation results

    (cont.) We first address the complexity of finding an optimal minimum cost solution to a congestion game. We consider both network and general congestion games, and we examine several variants of the problem concerning the structure of the game and its associated cost functions. Many of the problem …

    mit Repository record for Network flow problems and congestion games : complexity and approximation results (opens in a new tab)

  5. Efficiency loss in resource allocation games

    The overarching goals of this thesis are to quantify the efficiency loss due to market participant strategic behavior, and to design proper pricing mechanisms that reduce the efficiency loss. The concept of efficiency loss is intimately related to the concept of "price of anarchy," which was …

    mit Repository record for Efficiency loss in resource allocation games (opens in a new tab)

  6. Design of Scheduling Algorithms Using Game Theoretic Ideas

    <p>Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling …

    duke Repository record for Design of Scheduling Algorithms Using Game Theoretic Ideas (opens in a new tab)

  7. Dynamics and Phenomena in Stateful Multi-Agent Systems

    An important goal at the intersection of theoretical computer science and economics is to understand the long-run outcomes of complex processes in multi-agent systems. In many cases, such social systems are inherently algorithmic and strategic; in others, agents may act in simpler behavioral ways …

    cornell Repository record for Dynamics and Phenomena in Stateful Multi-Agent Systems (opens in a new tab)

  8. A game theoretic approach to UAV routing and information collection

    In recent times, the use of Unmanned aerial vehicles (UAVs) for tasks which involve high endurance or perilous environments, has become increasingly vital. A typical problem is that of information collection, in particular when multiple UAVs are involved, which prompts an important problem of

    uiuc Repository record for A game theoretic approach to UAV routing and information collection (opens in a new tab)

  9. Selfish versus coordinated routing in network games

    … us with insights and additional understanding of network problems, but it also allows us to design approximation algorithms for computationally difficult problems. More specifically, the conflicting objectives of the users prompt the definition of a network game in which they minimize their own …

    mit Repository record for Selfish versus coordinated routing in network games (opens in a new tab)

  10. Efficiency-risk tradeoffs in dynamic oligopoly markets : with application to electricity markets

    In an abstract framework, we examine how a tradeoff between efficiency and risk arises in different dynamic oligopolistic markets. We consider a scenario where there is a reliable resource provider and agents which enter and exit the market following a random process. Self-interested and fully …

    mit Repository record for Efficiency-risk tradeoffs in dynamic oligopoly markets : with application to electricity markets (opens in a new tab)

  11. Multi-Leader Congestion Games with an Adversary

    … was to understand the result and the impact of selfish acting individuals in these games. In this regard, we analyzed the existence, the computation and the quality of (approximate) pure Nash equilibria. First, we observed that an exact pure Nash equilibrium always exists in the resulting …

    passau-thes Repository record for Multi-Leader Congestion Games with an Adversary (opens in a new tab)

  12. Equilibrium characterization for resource allocation games on single-path serial networks

    … agents based on their specific valuations of said good. The distribution is done by a particular scheme first studied by Kelly [15] with no price-discrimination. In a further study by Johari and Tsitsiklis [13], they aim to distribute the link capacities of a network among different users. …

    mit Repository record for Equilibrium characterization for resource allocation games on single-path serial networks (opens in a new tab)

  13. Dynamic processes on complex networks : from disease spreading to neural activity

    The study of dynamic processes that take place on heterogeneous networks is essential to better understand, forecast, and manage human activities in an increasingly connected world. In this Thesis, we elucidate the role of the network topology as well as the nature of the underlying processes in a …

    mit Repository record for Dynamic processes on complex networks : from disease spreading to neural activity (opens in a new tab)

  14. Competition and congestion in the National Aviation System : multi-agent, multi-stakeholder approaches for evaluation and mitigation

    … These interactions determine the state of the system. NAS congestion and delays result in additional operating costs and reduced profitability for the airlines, a decrease in the level-of-service to passengers, and a decrease in the efficiency of NAS resource utilization. We evaluate the …

    mit Repository record for Competition and congestion in the National Aviation System : multi-agent, multi-stakeholder approaches for evaluation and mitigation (opens in a new tab)

  15. Machine Learning Aided Decision Making and Adaptive Stochastic Control in a Hierarchical Interactive Smart Grid

    … This hierarchical architecture consists of different layers ranging from the households, microgrid controller level, feeder level and substation level. The proposed smart grid architecture is scalable while allowing for sufficient resource pooling, because in each layer the power …

    unm Repository record for Machine Learning Aided Decision Making and Adaptive Stochastic Control in a Hierarchical Interactive Smart Grid (opens in a new tab)

  16. Risk-averse multi-armed bandits and game theory

    … expected cumulative reward and the expected payoffs in a game, respectively. In contrast, the rewards and the payoffs are often random variables whose expected values only capture a vague idea of the overall distribution. The focus of this dissertation is to study the fundamental limits of the …

    uiuc Repository record for Risk-averse multi-armed bandits and game theory (opens in a new tab)

  17. Potential-based analysis of social, communication, and distributed networks

    In recent years, there has been a wide range of studies on the role of social and distributed networks in various disciplinary areas. In particular, availability of large amounts of data from online social networks and advances in control of distributed systems have drawn the attention of many …

    uiuc Repository record for Potential-based analysis of social, communication, and distributed networks (opens in a new tab)

  18. Pricing Decentralization in Customized Pricing Systems and Network Models

    In this thesis, we study the implications of multi-party pricing for both consumers and producers in different settings. Within most organizations, the final price of a product or service is usually the result of a chain of pricing decisions. This chain may consist of different departments of the …

    columbia-diss Repository record for Pricing Decentralization in Customized Pricing Systems and Network Models (opens in a new tab)