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 “"Pure Nash Equilibrium"”.

  1. Αλγοριθμική και εξελικτική θεωρία παιγνίων

    … two algorithms for computing an e-approximate Nash equilibrium for the case where e is an absolute constant. The approximations achieved by our algorithms are e=3/4 and e=(2+l)/4 respectively, where $\lambda$ is the minimum, among all Nash equilibria, payoff of either player. Furthermore, we …

    greece Repository record for Αλγοριθμική και εξελικτική θεωρία παιγνίων (opens in a new tab)

  2. Learning in inventory competition games

    In a noncooperative game with rational players, Nash strategies are one of the strategies that players can agree on, because none of the players are willing to impose damage to the competitor by lowering their own expected profit. In this dissertation, we incorporate fixed-ordering costs in an …

    hawaii Repository record for Learning in inventory competition games (opens in a new tab)

  3. Cubes, grids and induced subgraphs: topics in extremal and probabilistic combinatorics

    … (that is, without indifferences) and has a pure Nash equilibrium and a "large" number of players is "connected", meaning that every action profile that is not a pure Nash equilibrium can reach every pure Nash equilibrium via a best-response path. This has important implications for dynamics …

    oxford Repository record for Cubes, grids and induced subgraphs: topics in extremal and probabilistic combinatorics (opens in a new tab)

  4. Congestion game-based task allocation for multi-robot teams

    … algorithm is proposed and its convergence to a pure Nash equilibrium is proved. For MRTA problems with heterogeneous robot teams, the best sequential dynamics is shown to converge to pure Nash equilibrium in the framework of weighted congestion games. The suboptimality of the approximate …

    gatech Repository record for Congestion game-based task allocation for multi-robot teams (opens in a new tab)

  5. Game theoretic approaches to cooperation in wireless networks

    … this partition in a distributed manner with purely local information and yet provide near optimal coverage. We formulate this coverage problem as a coverage game and prove that the optimal solution is a pure Nash equilibrium. We then design synchronous and asynchronous algorithms, which …

    nus Repository record for Game theoretic approaches to cooperation in wireless networks (opens in a new tab) Download file for Game theoretic approaches to cooperation in wireless networks (opens in a new tab)

  6. Essays in Decision Theory

    … the empirical distribution can converge to a pure Nash equilibrium if the perturbation term is bounded. Furthermore, I introduce an updating rule for the perturbation term. I prove that if the perturbation term is updated in accordance with this rule, then play can converge to a pure Nash …

    vt Repository record for Essays in Decision Theory (opens in a new tab)

  7. On Multi-Agent Reinforcement Learning in Matrix, Stochastic and Differential Games

    … the proposed CLR-EMAQL algorithm converges to Nash equilibrium in games with pure Nash equilibrium. We introduce the concept of Win-or-Learn-Slow (WoLS) mechanism for the proposed EMAQL algorithm so that the proposed algorithm learns slowly when it is losing. We also provide a theoretical proof …

    carleton Repository record for On Multi-Agent Reinforcement Learning in Matrix, Stochastic and Differential Games (opens in a new tab)

  8. Network Economics-based Crowdsourcing in Online Social Networks

    … each user to report its information. A Pure Nash Equilibrium (PNE) is determined resulting in the optimal rewards each MA should provide to each user. The performance evaluation of the proposed approach is achieved via modeling and simulation, and numerical results are presented to …

    unm Repository record for Network Economics-based Crowdsourcing in Online Social Networks (opens in a new tab)

  9. Artificial Intelligence Enabled Distributed Edge Computing for Internet of Things Applications

    … model. The existence of at least one Pure Nash Equilibrium (PNE) point is shown by proving that the game is submodular. Furthermore, different operation points (i.e., offloading strategies) are obtained and studied, based either on the outcome of Best Response Dynamics (BRD) algorithm, …

    unm Repository record for Artificial Intelligence Enabled Distributed Edge Computing for Internet of Things Applications (opens in a new tab)

  10. Energy Efficient Offloading for Competing Users on a Shared Communication Channel

    … sets its offloading decisions always has a pure Nash equilibrium, and a Gauss-Seidel method for determining this equilibrium is introduced. Results are presented which illustrate that the system always converges to a Nash equilibrium using the Gauss-Seidel method. Data is also presented …

    mcmaster Repository record for Energy Efficient Offloading for Competing Users on a Shared Communication Channel (opens in a new tab)

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

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

    … integer 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 …

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

  13. Diffusion Dynamics in Interconnected Communities

    … goods (FMCG). It is shown that an epsilon-equilibrium exists in the DCG marketing game and a pure Nash equilibrium exists in the FMCG marketing game. The Price of Anarchy (PoA) in both marketing games is found to be bounded by 2. Also, it is shown that any two Nash equilibria for the FMCG …

    maryland Repository record for Diffusion Dynamics in Interconnected Communities (opens in a new tab)

  14. Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων

    … We prove that the resulting game always has a pure Nash equilibrium. Experiments suggest that these equilibria are not hard to compute, have characteristics consistent with what we know about the worldwide web, and seem to have very favorable price of anarchy. Quantifying rigorously the price …

    greece Repository record for Μελέτη του παγκόσμιου ιστού με χρήση θεωρίας οικονομικών και παιγνίων (opens in a new tab)

  15. Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας

    … the arising classes of games, the existence of pure Nash equilibrium and potentials and the behaviour of the price of anarchy is studied. Uniting the above directions, a new way for improving the price of anarchy in congestion games with uncertain delays and risk averse users is given. More …

    greece Repository record for Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας (opens in a new tab)

  16. Resource Allocation in SDN/NFV-Enabled Core Networks

    … an exact potential game admitting at least one pure Nash Equilibrium (NE) and has the finite improvement property (FIP). Then, we design two iterative algorithms, namely, the best response (BR) algorithm with fast convergence and the spatial adaptive play (SAP) algorithm with great potential to …

    waterloo Repository record for Resource Allocation in SDN/NFV-Enabled Core Networks (opens in a new tab)

  17. Optimization and Information Problems in Operations

    … information-sharing outcomes could emerge as an equilibrium where publicly sharing information typically will not hurt, especially, sometimes it can achieve Pareto improvement of the supply chain and consumer welfare. Finally, when a single supplier serves multiple markets, the heterogeneity …

    wustl Repository record for Optimization and Information Problems in Operations (opens in a new tab)

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

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