869 resultados para Nash equilibria for discontinuous games
Resumo:
In the 1992 Barcelona Olympic Games, besides the country-versus-country typical showdown in the backdrop of Olympics, and the economic and political impulses for the host city, there was a third factor complicating the celebration: rivalry between the Catalan hosts and the Spanish state. By guiding the development of and eventual Olympic projection of national identity, Catalan and Spanish politicians hoped to create a resounding rallying point around which they could unite disparate individuals. The text is made up of: an introduction, five paragraphs on the different political perspective, conclusions, a commentary on the tallying of score and a note section with bibliographical references.
Resumo:
We consider cooperative environments with externalities (games in partition function form) and provide a recursive definition of dividends for each coalition and any partition of the players it belongs to. We show that with this definition and equal sharing of these dividends the averaged sum of dividends for each player, over all the coalitions that contain the player, coincides with the corresponding average value of the player. We then construct weighted Shapley values by departing from equal division of dividends and finally, for each such value, provide a bidding mechanism implementing it.
Resumo:
This paper was presented at the International Sport Business Symposium, held by the Capital University of Economics and Business in Beijing, in 2008. The speakers, Ferran Brunet, as a professor at the Autonomous University of Barcelona and Zuo Xinwen, as a member of Beijing Development and Reform Commission, both set out to analyze changes in the economic and social development of the city which were undertaken with the aim to celebrate the 2008 Olympic Games. They discuss aspects as a transformation in the mode of economic growth, resources of the Organizing Committee, investments related to the Games, transport and communications, industries, the balance of urban and rural development, urban construction and management service and operations into a well-off society.
Resumo:
This paper revisits the problem of adverse selection in the insurance market of Rothschild and Stiglitz [28]. We propose a simple extension of the game-theoretic structure in Hellwig [14] under which Nash-type strategic interaction between the informed customers and the uninformed firms results always in a particular separating equilibrium. The equilibrium allocation is unique and Pareto-efficient in the interim sense subject to incentive-compatibility and individual rationality. In fact, it is the unique neutral optimum in the sense of Myerson [22].
Resumo:
In this paper, we consider an exchange economy µa la Shitovitz (1973), with atoms and an atomless set. We associate with it a strategic market game of the kind first proposed by Lloyd S. Shapley and known as the Shapley window model. We analyze the relationship between the set of the Cournot-Nash equilibrium allocations of the strategic market game and the Walras equilibrium allocations of the exchange economy with which it is associated. We show, with an example, that even when atoms are countably in¯nite, any Cournot-Nash equilibrium allocation of the game is not a Walras equilibrium of the underlying exchange economy. Accordingly, in the original spirit of Cournot (1838), we par- tially replicate the mixed exchange economy by increasing the number of atoms, without a®ecting the atomless part, and ensuring that the measure space of agents remains finite. We show that any sequence of Cournot-Nash equilibrium allocations of the strategic market games associated with the partially replicated exchange economies approximates a Walras equilibrium allocation of the original exchange economy.
Resumo:
In this paper we assume that for some commodities individuals may wish to adjust their levels of consumption from their normal Marshallian levels so as to match the consumption levels of a group of other individuals, in order to signal that they conform to the consumption norms of that group. Unlike Veblen’s concept of conspicuous consumption this can mean that some individuals may reduce their consumption of the relevant commodities. We model this as a three-stage game in which individuals first decide whether or not they wish to adhere to a norm, then decide which norm they wish to adhere to, and finally decide their actual consumption. We present a number of examples of the resulting equilibria, and then discuss the potential policy implications of this model.
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:
There are two ways of creating incentives for interacting agents to behave in a desired way. One is by providing appropriate payoff incentives, which is the subject of mechanism design. The other is by choosing the information that agents observe, which we refer to as information design. We consider a model of symmetric information where a designer chooses and announces the information structure about a payoff relevant state. The interacting agents observe the signal realizations and take actions which affect the welfare of both the designer and the agents. We characterize the general finite approach to deriving the optimal information structure for the designer - the one that maximizes the designer's ex ante expected utility subject to agents playing a Bayes Nash equilibrium. We then apply the general approach to a symmetric two state, two agent, and two actions environment in a parameterized underlying game and fully characterize the optimal information structure: it is never strictly optimal for the designer to use conditionally independent private signals; the optimal information structure may be a public signal or may consist of correlated private signals. Finally, we examine how changes in the underlying game affect the designer's maximum payoff. This exercise provides a joint mechanism/information design perspective.
Resumo:
Bilateral oligopoly is a strategic market game with two commodities, allowing strategic behavior on both sides of the market. When the number of buyers is large, such a game approximates a game of quantity competition played by sellers. We present examples which show that this is not typically a Cournot game. Rather, we introduce an alternative game of quantity competition (the market share game) and, appealing to results in the literature on contests, show that this yields the same equilibria as the many-buyer limit of bilateral oligopoly, under standard assumptions on costs and preferences. We also show that the market share and Cournot games have the same equilibria if and only if the price elasticity of the latter is one. These results lead to necessary and sufficient conditions for the Cournot game to be a good approximation to bilateral oligopoly with many buyers and to an ordering of total output when they are not satisfied.
Resumo:
This Working Paper was presented at the international workshop "Game Theory in International Relations at 50", organized and coordinated by Professor Jacint Jordana and Dr. Yannis Karagiannis at the Institut Barcelona d'Estudis Internacionals on May 22, 2009. The day-long Workshop was inspired by the desire to honour the ground-breaking work of Professor Thomas Schelling in 1959-1960, and to understand where the discipline International Relations lies today vis-à-vis game theory.
Resumo:
In this paper we unify, simplify, and extend previous work on the evolutionary dynamics of symmetric N-player matrix games with two pure strategies. In such games, gains from switching strategies depend, in general, on how many other individuals in the group play a given strategy. As a consequence, the gain function determining the gradient of selection can be a polynomial of degree N-1. In order to deal with the intricacy of the resulting evolutionary dynamics, we make use of the theory of polynomials in Bernstein form. This theory implies a tight link between the sign pattern of the gains from switching on the one hand and the number and stability of the rest points of the replicator dynamics on the other hand. While this relationship is a general one, it is most informative if gains from switching have at most two sign changes, as is the case for most multi-player matrix games considered in the literature. We demonstrate that previous results for public goods games are easily recovered and extended using this observation. Further examples illustrate how focusing on the sign pattern of the gains from switching obviates the need for a more involved analysis.
Resumo:
We construct a new family of semi-discrete numerical schemes for the approximation of the one-dimensional periodic Vlasov-Poisson system. The methods are based on the coupling of discontinuous Galerkin approximation to the Vlasov equation and several finite element (conforming, non-conforming and mixed) approximations for the Poisson problem. We show optimal error estimates for the all proposed methods in the case of smooth compactly supported initial data. The issue of energy conservation is also analyzed for some of the methods.
Resumo:
A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.