981 resultados para non-cooperative game
Resumo:
We propose a bargaining process supergame over the strategies to play in a non-cooperative game. The agreement reached by players at the end of the bargaining process is the strategy profile that they will play in the original non-cooperative game. We analyze the subgame perfect equilibria of this supergame, and its implications on the original game. We discuss existence, uniqueness, and efficiency of the agreement reachable through this bargaining process. We illustrate the consequences of applying such a process to several common two-player non-cooperative games: the Prisoner’s Dilemma, the Hawk-Dove Game, the Trust Game, and the Ultimatum Game. In each of them, the proposed bargaining process gives rise to Pareto-efficient agreements that are typically different from the Nash equilibrium of the original games.
Resumo:
In this paper we study a model where non-cooperative agents may exchange knowledge in a competitive environment. As a potential factor that could induce the knowledge disclosure between humans we consider the timing of the moves of players. We develop a simple model of a multistage game in which there are only three players and competition takes place only within two stages. Players can share their private knowledge with their opponents and the knowledge is modelled as in uencing their marginal cost of e¤ort. We identify two main mechanisms that work towards knowledge disclosure. One of them is that before the actual competition starts, the stronger player of the rst stage of a game may have desire to share his knowledge with the "observer", be- cause this reduces the valuation of the prize of the weaker player of that stage and as a result his e¤ort level and probability of winning in a ght. Another mechanism is that the "observer" may have sometimes desire to share knowledge with the weaker player of the rst stage, because in this way, by increasing his probability of winning in that stage, he decreases the probability of winning of the stronger player. As a result, in the second stage the "observer" may have greater chances to meet the weaker player rather than the stronger one. Keywords: knowledge sharing, strategic knowledge disclosure, multistage contest game, non-cooperative games
Resumo:
It is well-known that non-cooperative and cooperative game theory may yield different solutions to games. These differences are particularly dramatic in the case of truels, or three-person duels, in which the players may fire sequentially or simultaneously, and the games may be one-round or n-round. Thus, it is never a Nash equilibrium for all players to hold their fire in any of these games, whereas in simultaneous one-round and n-round truels such cooperation, wherein everybody survives, is in both the a -core and ß -core. On the other hand, both cores may be empty, indicating a lack of stability, when the unique Nash equilibrium is one survivor. Conditions under which each approach seems most applicable are discussed. Although it might be desirable to subsume the two approaches within a unified framework, such unification seems unlikely since the two approaches are grounded in fundamentally different notions of stability.
Resumo:
Thèse numérisée par la Division de la gestion de documents et des archives de l'Université de Montréal
Resumo:
In this paper is presented a Game Theory based methodology to allocate transmission costs, considering cooperation and competition between producers. As original contribution, it finds the degree of participation on the additional costs according to the demand behavior. A comparative study was carried out between the obtained results using Nucleolus balance and Shapley Value, with other techniques such as Averages Allocation method and the Generalized Generation Distribution Factors method (GGDF). As example, a six nodes network was used for the simulations. The results demonstrate the ability to find adequate solutions on open access environment to the networks.
Resumo:
According to the account of the European Union (EU) decision making proposed in this paper, this is a bargaining process during which actors shift their policy positions with a view to reaching agreements on controversial issues.
Resumo:
In this paper, we extend the non-cooperative analysis of oligopoly to exchange economics with infinitely many commodities by using strategic market games. This setting can be interpreted as a model of oligopoly with differentiated commodities by using the Hotelling line. We prove the existence of an "active" Cournot-Nash equilibrium and show that, when traders are replicated, the price vector and the allocation converge to the Walras equilibrium. We examine how the notion of oligopoly extends to our setting with a countable infinity of commodities by distinguishing between asymptotic oligopolists and asymptotic price-takes. We illustrate these notions via a number of examples.
Resumo:
Transthyretin (TTR) is a tetrameric beta-sheet-rich transporter protein directly involved in human amyloid diseases. Several classes of small molecules can bind to TTR delaying its amyloid fibril formation, thus being promising drug candidates to treat TTR amyloidoses. In the present study, we characterized the interactions of the synthetic triiodo L-thyronine analogs and thyroid hormone nuclear receptor TR beta-selecfive agonists GC-1 and GC-24 with the wild type and V30M variant of human transthyretin (TTR). To achieve this aim, we conducted in vitro TTR acid-mediated aggregation and isothermal titration calorimetry experiments and determined the TTR:GC-1 and TTR:GC-24 crystal structures. Our data indicate that both GC-1 and GC-24 bind to TTR in a non-cooperative manner and are good inhibitors of TTR aggregation, with dissociation constants for both hormone binding sites (HBS) in the low micromolar range. Analysis of the crystal structures of TTRwt:GC-1(24) complexes and their comparison with the TTRwt X-ray structure bound to its natural ligand thyroxine (T4) suggests, at the molecular level, the basis for the cooperative process displayed by T4 and the non-cooperative process provoked by both GC-1 and GC-24 during binding to TTR. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
This paper presents an analysis and discussion, based on cooperative game theory, for the allocation of the cost of losses to generators and demands in transmission systems. We construct a cooperative game theory model in which the players are represented by equivalent bilateral exchanges and we search for a unique loss allocation solution, the Core. Other solution concepts, such as the Shapley Value, the Bilateral Shapley Value and the Kernel are also explored. Our main objective is to illustrate why is not possible to find an optimal solution for allocating the cost of losses to the users of a network. Results and relevant conclusions are presented for a 4-bus system and a 14-bus system. (c) 2007 Elsevier B.V. All rights reserved.
Resumo:
Tracking or target localization is used in a wide range of important tasks from knowing when your flight will arrive to ensuring your mail is received on time. Tracking provides the location of resources enabling solutions to complex logistical problems. Wireless Sensor Networks (WSN) create new opportunities when applied to tracking, such as more flexible deployment and real-time information. When radar is used as the sensing element in a tracking WSN better results can be obtained; because radar has a comparatively larger range both in distance and angle to other sensors commonly used in WSNs. This allows for less nodes deployed covering larger areas, saving money. In this report I implement a tracking WSN platform similar to what was developed by Lim, Wang, and Terzis. This consists of several sensor nodes each with a radar, a sink node connected to a host PC, and a Matlab© program to fuse sensor data. I have re-implemented their experiment with my WSN platform for tracking a non-cooperative target to verify their results and also run simulations to compare. The results of these tests are discussed and some future improvements are proposed.
Resumo:
2010 Mathematics Subject Classification: 35J65, 35K60, 35B05, 35R05.