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 20 of 630 for “"nash equilibrium"”.

  1. Supercore and Strong Nash Equilibrium

    … and Aumann's (1959) notion of "strong Nash equilibrium" in normal-form games. Inarraet al. (2007) studied the relation between the supercore and Nash equilibrium; in particular, they offered a procedure to find the supercore in normal-form games. I extends Inarra et al.'s procedure to …

    nus Repository record for Supercore and Strong Nash Equilibrium (opens in a new tab) Download file for Supercore and Strong Nash Equilibrium (opens in a new tab)

  2. Nash Equilibrium Seeking Over Networks

    The problem of Nash equilibrium seeking is investigated in a networked game. The game is defined as being played by a collection of a finite number of players whose cost functions are dependent on the actions of any subset of players in the network. This dependency is captured by a graph referred …

    toronto-retro Repository record for Nash Equilibrium Seeking Over Networks (opens in a new tab)

  3. Existence of nash equilibrium in atomless games

    … and also prove the existence of a pure strategy equilibrium for a finite game when the action space is countable but not necessarily compact.Another aspect of this thesis focuses on large games. We show the existence of equilibrium for a game with continuum of players that are divided into finite …

    nus Repository record for Existence of nash equilibrium in atomless games (opens in a new tab) Download file for Existence of nash equilibrium in atomless games (opens in a new tab)

  4. Nash Equilibrium Seeking with Dynamic Agents in Networks

    … methods of designing distributed (generalized) Nash equilibrium (GNE) seeking algorithms in continuous-time for agents with inherent dynamics. In real-world applications, the action of each agent may correspond to a physical quantity, that is actuated through a control input. In such settings, …

    toronto-retro Repository record for Nash Equilibrium Seeking with Dynamic Agents in Networks (opens in a new tab)

  5. METAMODEL-BASED GLOBAL OPTIMIZATION AND GENERALIZED NASH EQUILIBRIUM PROBLEMS

    … and global sensitivity analysis on generalized Nash equilibriums. Metamodels have been widely used in optimizing many complex design problems from natural science and engineering. In this thesis, we first propose a new adaptive framework for metamodel-based global optimization of computationally …

    nus Repository record for METAMODEL-BASED GLOBAL OPTIMIZATION AND GENERALIZED NASH EQUILIBRIUM PROBLEMS (opens in a new tab) Download file for METAMODEL-BASED GLOBAL OPTIMIZATION AND GENERALIZED NASH EQUILIBRIUM PROBLEMS (opens in a new tab)

  6. Hardness and totality of problems related to Nash equilibrium

    … the computational complexity of various equilibrium problems and their applications—a central topic in algorithmic game theory. While the existence of solutions for classical equilibrium notions, such as generalized Nash equilibria and multi-leader–follower games with convex constraints, …

    uvic Repository record for Hardness and totality of problems related to Nash equilibrium (opens in a new tab)

  7. Value and Nash Equilibrium in Games of Optimal Stopping

    We study games of optimal stopping (Dynkin games). A Dynkin game is a mathematical model involving several competing players, each of them interested in capturing the moments when certain stochastic processes are at an extremum. Actions of players are referred to as “stopping” (of an underlying …

    whiterose Download PDF for Value and Nash Equilibrium in Games of Optimal Stopping (opens in a new tab)

  8. Globally Convergent Algorithms for the Solution of Generalized Nash Equilibrium Problems

    … Verfahren zur Lösung verallgemeinerter Nash-Gleichgewichtsprobleme mit dem Schwerpunkt auf deren globaler Konvergenz entwickelt. Ein globalisiertes Newton-Verfahren zur Berechnung normalisierter Lösungen, ein nichtglattes Optimierungsverfahren basierend auf einer unrestringierten …

    wurz-thes Repository record for Globally Convergent Algorithms for the Solution of Generalized Nash Equilibrium Problems (opens in a new tab)

  9. Numerical Methods for the Solution of the Generalized Nash Equilibrium Problem

    In the generalized Nash equilibrium problem not only the cost function of a player depends on the rival players' decisions, but also his constraints. This thesis presents different iterative methods for the numerical computation of a generalized Nash equilibrium, some of them globally, others …

    wurz-thes Repository record for Numerical Methods for the Solution of the Generalized Nash Equilibrium Problem (opens in a new tab)

  10. Distributed (Generalized) Nash Equilibrium Seeking in the Partial-Decision Information Setting

    … the problem of distributed (Generalized) Nash Equilibrium seeking over networks. In this setting, agents have limited information about the other agents' actions and communicate locally over a communication graph to learn these actions. We start by first formulating the (Generalized) Nash …

    toronto-retro Repository record for Distributed (Generalized) Nash Equilibrium Seeking in the Partial-Decision Information Setting (opens in a new tab)

  11. QRE vs Nash equilibrium: Evaluating the Jury Paradox in Voting Games

    In traditional game theory, Nash Equilibrium (NE) has been the dominant framework for predicting and explaining behaviour in strategic settings, including voting games. However, NE assumes fully rational decision-making in the sense that it assumes individuals make choices which are free of error. …

    auckland-tech Repository record for QRE vs Nash equilibrium: Evaluating the Jury Paradox in Voting Games (opens in a new tab)

  12. Nash equilibrium problems in power markets and product design: Analysis and algorithms

    … problem is a two-period risk-based stochastic Nash game with shared strategy sets. In general, this stochastic game has nonsmooth objectives and standard existence and uniqueness results cannot be leveraged for this class of games, given the lack of compactness of strategy sets and the absence …

    uiuc Repository record for Nash equilibrium problems in power markets and product design: Analysis and algorithms (opens in a new tab)

  13. ADMM-Type Methods for Optimization and Generalized Nash Equilibrium Problems in Hilbert Spaces

    … optimization problems and generalized Nash equilibrium problems in Hilbert spaces. This class of algorithms is inspired by the alternating direction method of multipliers (ADMM) and eliminates the constraints using an augmented Lagrangian approach. The alternating direction method …

    wurz-thes Repository record for ADMM-Type Methods for Optimization and Generalized Nash Equilibrium Problems in Hilbert Spaces (opens in a new tab)

  14. Primal and Dual Gap Functions for Generalized Nash Equilibrium Problems and Quasi-Variational Inequalities

    … of primal and dual gap functions for generalized Nash equilibrium problems (GNEPs) and finite-dimensional quasi-variational inequalities (QVIs). These gap functions are optimal value functions of primal and dual reformulations of a corresponding GNEP or QVI as a constrained or unconstrained …

    wurz-thes Repository record for Primal and Dual Gap Functions for Generalized Nash Equilibrium Problems and Quasi-Variational Inequalities (opens in a new tab)

  15. A Study of Heuristic Approaches for Solving Generalized Nash Equilibrium Problems and Related Games

    … computational heuristics for solving generalized Nash equilibrium problems (GNEPs) and related games is explored. In a model of competitive helping, agent-based simulations are used as a complementary analysis tool in conjunction with replicator equations. These agent-based simulations highlight …

    guelph Repository record for A Study of Heuristic Approaches for Solving Generalized Nash Equilibrium Problems and Related Games (opens in a new tab)

  16. Two Heuristic Models for Solving Generalized Nash Equilibrium Problems using a Novel Penalty Function

    In this work, we solve Generalized Nash Equilibrium Problems using two novel heuristic models. We introduce the Shadow Point function, a novel penalty function for Generalized Nash Equilibrium Problems, similar to the Nikaido-Isoda penalty function to motivate the behavior of these two models. The …

    guelph Repository record for Two Heuristic Models for Solving Generalized Nash Equilibrium Problems using a Novel Penalty Function (opens in a new tab)

  17. DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND

    Nash equilibrium problems (NEPs) have gained popularity in recent years in the engineering community due to their ready applicability to a wide variety of practical problems ranging from communication network design to power market analysis. There are strong links between the tools used to analyze …

    purdue-thes Repository record for DECENTRALIZED ALGORITHMS FOR NASH EQUILIBRIUM PROBLEMS – APPLICATIONS TO MULTI-AGENT NETWORK INTERDICTION GAMES AND BEYOND (opens in a new tab)

  18. Non-Concave Programming and Differential Games in Dynamic Resource Allocation Models (Nash Equilibrium, Economic Growth)

    … essay, entitled "A Complete Characterization of Nash Equilibria in a Dynamic Resource Allocation Model," considers two agents, each trying to maximize the sum of his own discounted utilities subject to the common natural growth function of the resource.

    uiuc Repository record for Non-Concave Programming and Differential Games in Dynamic Resource Allocation Models (Nash Equilibrium, Economic Growth) (opens in a new tab)

  19. Essays on Network formation games

    … dissertation. Chapter 2 studies the possible Nash equilibrium configurations in a model of signed network formation as proposed by Hiller (2017). We specify the Nash equilibria in the case of heterogeneous agents. We find 3 possible Nash equilibrium configurations: Utopia network, positive …

    vt Repository record for Essays on Network formation games (opens in a new tab)

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

Page 1 of 32