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 537 for “"NASH"”.

  1. John Nash : Paintings and watercolours.

    Abstract not provided.

    sheffield-hallam Repository record for John Nash : Paintings and watercolours. (opens in a new tab)

  2. Robustness of Bayesian Nash Equilibria

    As an application, I show how the mechanism design problem is altered by allowing perturbations in the information structure.

    uiuc Repository record for Robustness of Bayesian Nash Equilibria (opens in a new tab)

  3. Selected Applications of the Nash-Williams Lemma

    … along with a formal statement and proof of the Nash-Williams Lemma. Reconstructibility conditions concerned with comparing the size and order of general graphs will then be established with an in depth look at conditions dealing with the minimum, average and maximum degrees of bidegreed, …

    mo-state Repository record for Selected Applications of the Nash-Williams Lemma (opens in a new tab)

  4. Well-Posedness of Singularly Perturbed Nash Games

    Made available in DSpace on 2014-12-12T20:54:53Z (GMT). No. of bitstreams: 1 7913466.pdf: 2508868 bytes, checksum: a04b35f16d2228df18e8acb076c65064 (MD5) Previous issue date: 1978

    uiuc Repository record for Well-Posedness of Singularly Perturbed Nash Games (opens in a new tab)

  5. Leader-Follower and Nash Strategies With State Information

    Made available in DSpace on 2014-12-12T20:55:09Z (GMT). No. of bitstreams: 1 8009125.pdf: 4919592 bytes, checksum: 4a4f906b0988fedf372c6af6d4df7524 (MD5) Previous issue date: 1979

    uiuc Repository record for Leader-Follower and Nash Strategies With State Information (opens in a new tab)

  6. Information Structures in Nash and Leader-Follower Strategies

    The role of information structures in some Nash and Leader-Follower games is examined. By preserving the information structure of the full order singularly perturbed game, while solving the reduced order ones, reduced order near optimal strategies are obtained and well-posedness is shown for two …

    uiuc Repository record for Information Structures in Nash and Leader-Follower Strategies (opens in a new tab)

  7. Nonalcoholic steatohepatitis (NASH) : animal studies of interactive hepatoxicity

    The term "Nonalcoholic steatohepatitis" (NASH) describes a form of liver disease indistinguishable from alcoholic liver disease, but present in persons who consume insignificant amounts of alcohol. The spectrum of non-alcoholic liver disease ranges from non-progressive steatosis, through to NASH and …

    cape-town Repository record for Nonalcoholic steatohepatitis (NASH) : animal studies of interactive hepatoxicity (opens in a new tab)

  8. O Principio de Ekeland e o Teorema de Nash-Moser

    No início desse estudo apresentamos 0 princípio de Ekeland, que será uma ferramenta essencial na demonstração do teorerna. Estudamos conceitos elementares de Análise Convexa e caracterizamos o subdiferencial da norma de um espaço de Banach. Essa caracterização será usada Várias vezes na prova do …

    brazil-ufv Repository record for O Principio de Ekeland e o Teorema de Nash-Moser (opens in a new tab)

  9. Investigating coevolutionary algorithms for finding Nash equilibria in cybersecurity problems

    … coevolutionary algorithms and investigated Nash equilibria within these cybersecurity problems. In particular, we examined and presented variations on two existing algorithms that look for Nash equilibria: NashSolve and HybridCoev. To compare these algorithms' performances against other …

    mit Repository record for Investigating coevolutionary algorithms for finding Nash equilibria in cybersecurity problems (opens in a new tab)

  10. Control of large distributed systems using games with pure strategy nash equilibria

    … we adopt is (i) to use games with pure strategy Nash equilibria as a framework or template for constructing the agents’ utility functions, such that good solutions to the optimisation problem arise at the pure strategy Nash equilibria of the game, and (ii) to derive distributed techniques for …

    soton Repository record for Control of large distributed systems using games with pure strategy nash equilibria (opens in a new tab)

  11. Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints

    … N -player games, called generalized Nash games with shared constraints, or simply, shared-constraint games. In such a game, every strategy-tuple is constrained to lie in a subset C of the product space of strategies. Thus strategies available to a player are only those which when …

    uiuc Repository record for Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints (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. The role of "non-alcoholic steatohepatitis (NASH)" in methotrexate induced liver injury

    … resemble those of nonalcoholic steatohepatitis (NASH). Moreover most of the risk factors of MTX induced liver injury are also associated with NASH. In this study serial liver biopsies of 24 psoriatic patients on lOng-term MTX were investigated to determine whether they had risk factors for NASH

    cape-town Repository record for The role of "non-alcoholic steatohepatitis (NASH)" in methotrexate induced liver injury (opens in a new tab)

  14. The complexity of Nash equilibria in multiplayer zero-sum games and coordination games

    … convergence of no-regret learning algorithms to Nash equilibria. Given that three player zero-sum games are already PPAD-complete, this class of games, i.e. with pairwise separable utility functions, defines essentially the broadest class of multi-player constants sum games to which we can hope …

    mit Repository record for The complexity of Nash equilibria in multiplayer zero-sum games and coordination games (opens in a new tab)

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

Page 1 of 27