772 resultados para C72 - Noncooperative Games
Resumo:
In this paper we consider a model with two industrialized countries that face a flow of immigration from the "rest of the world." The countries differ in three characteristics: the labor complementarity between the "native" population and immigrants, the population size, and the magnitude of the cultural friction between the natives and immigrants. We consider a non-cooperative game between two countries' when their strategic instrument is the choice of an immigration quota and the world immigrant wages introduce the spill-over effect between two countries. We first show that the quota game admits unique pure strategies Nash equilibrium. We then compare the equilibrium choices of two countries and show that even though the larger country attracts more immigrants, it chooses lower quota than its smaller counterpart. It also turns out that higher degree of labor complementarity between natives and immigrants and a lower degree of cultural friction between two groups yield higher immigration quota. We also examine the welfare implications of countries choices' and argue that coordinated and harmonized immigration policies may improve the welfare of both countries.
Resumo:
In a strategic trade policy, it is assumed, in this paper, that a government changes disbursement or levy method so that the reaction function of home firm approaches infinitely close to that of foreign firm. In the framework of Bertrand-Nash equilibrium, Eaton and Grossman[1986] showed that export tax is preferable to export subsidy. In this paper, it is shown that export subsidy is preferable to export tax in some cases in the framework of Bertrand-Nash equilibrium, considering the uncertainty in demand. Historically, many economists mentioned non-linear subsidy or tax. However, optimum solution of it has not yet been shown. The optimum solution is shown in this paper.
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:
We introduce a procedure to infer the repeated-game strategies that generate actions in experimental choice data. We apply the technique to set of experiments where human subjects play a repeated Prisoner's Dilemma. The technique suggests that two types of strategies underly the data.
Resumo:
One of the few stylized facts in international relations is that democracies, unlike autoc- racies, very rarely fight each other. We examine the sustainability of international peace between democracies and autocracies, where the crucial difference between these two po- litical regimes is whether or not policymakers are subject to periodic elections. We show that the fear of losing office can deter democratic leaders from engaging in military con- flicts. Crucially, this discipline effect can only be at work if incumbent leaders can be re-elected, implying that democracies in which the executives are subject to term limits should be more conflict prone. To assess the validity of our predictions, we construct a large dataset on countries with executive term limits. Our analysis of inter-state conflicts for the 1816-2001 period suggests that electoral incentives are indeed behind the democratic peace phenomenon: while democratic dyads are in general less likely to be involved in conflicts than any other dyads, this result does not hold for democracies in which the executive faces binding term limits; moreover, the dispute patterns of democracies with term limits depend on whether the executive is in the last or penultimate mandate.
Resumo:
In elections, majority divisions pave the way to focal manipulations and coordination failures, which can lead to the victory of the wrong candidate. This paper shows how this flaw can be addressed if voter preferences over candidates are sensitive to information. We consider two potential sources of divisions: majority voters may have similar preferences but opposite information about the candidates, or opposite preferences. We show that when information is the source of majority divisions, Approval Voting features a unique equilibrium with full information and coordination equivalence. That is, it produces the same outcome as if both information and coordination problems could be resolved. Other electoral systems, such as Plurality and Two-Round elections, do not satisfy this equivalence. The second source of division is opposite preferences. Whenever the fraction of voters with such preferences is not too large, Approval Voting still satisfies full information and coordination equivalence.
Resumo:
We consider a version of the cooperative buyer-seller market game of Shapley and Shubik (1972). For this market we propose a c1ass of sealed- bid auctions where objects are sold simultaneously at a market c1earing price rule. We ana1yze the strategic games induced by these mechanisms under the complete information approach. We show that these noncooperative games can be regarded as a competitive process for achieving a cooperative outcome: every Nash equilibrium payoff is a core outcome of the cooperative market game. Precise answers can be given to the strategic questions raised.
Resumo:
In noncooperative cost sharing games, individually strategic agents choose resources based on how the welfare (cost or revenue) generated at each resource (which depends on the set of agents that choose the resource) is distributed. The focus is on finding distribution rules that lead to stable allocations, which is formalized by the concept of Nash equilibrium, e.g., Shapley value (budget-balanced) and marginal contribution (not budget-balanced) rules.
Recent work that seeks to characterize the space of all such rules shows that the only budget-balanced distribution rules that guarantee equilibrium existence in all welfare sharing games are generalized weighted Shapley values (GWSVs), by exhibiting a specific 'worst-case' welfare function which requires that GWSV rules be used. Our work provides an exact characterization of the space of distribution rules (not necessarily budget-balanced) for any specific local welfare functions remains, for a general class of scalable and separable games with well-known applications, e.g., facility location, routing, network formation, and coverage games.
We show that all games conditioned on any fixed local welfare functions possess an equilibrium if and only if the distribution rules are equivalent to GWSV rules on some 'ground' welfare functions. Therefore, it is neither the existence of some worst-case welfare function, nor the restriction of budget-balance, which limits the design to GWSVs. Also, in order to guarantee equilibrium existence, it is necessary to work within the class of potential games, since GWSVs result in (weighted) potential games.
We also provide an alternative characterization—all games conditioned on any fixed local welfare functions possess an equilibrium if and only if the distribution rules are equivalent to generalized weighted marginal contribution (GWMC) rules on some 'ground' welfare functions. This result is due to a deeper fundamental connection between Shapley values and marginal contributions that our proofs expose—they are equivalent given a transformation connecting their ground welfare functions. (This connection leads to novel closed-form expressions for the GWSV potential function.) Since GWMCs are more tractable than GWSVs, a designer can tradeoff budget-balance with computational tractability in deciding which rule to implement.
Resumo:
In an abstract two-agent model, we show that every deterministic joint choice function compatible with the hypothesis that agents act noncooperatively is also compatible with the hypothesis that they act cooperatively. the converse is false.
Resumo:
We examine decision making in two-person extensive form game trees using nine treatments that vary matching protocol, payoffs, and payoff information. Our objective is to establish replicable principles of cooperative versus noncooperative behavior that involve the use of signaling, reciprocity, and backward induction strategies, depending on the availability of dominated direct punishing strategies and the probability of repeated interaction with the same partner. Contrary to the predictions of game theory, we find substantial support for cooperation under complete information even in various single-play treatments.
Resumo:
In the setting of noncooperative game theory, strategic negligibility of individual agents, or diffuseness of information, has been modeled as a nonatomic measure space, typically the unit interval endowed with Lebesgue measure. However, recent work has shown that with uncountable action sets, for example the unit interval, there do not exist pure-strategy Nash equilibria in such nonatomic games. In this brief announcement, we show that there is a perfectly satisfactory existence theory for nonatomic games provided this nonatomicity is formulated on the basis of a particular class of measure spaces, hyperfinite Loeb spaces. We also emphasize other desirable properties of games on hyperfinite Loeb spaces, and present a synthetic treatment, embracing both large games as well as those with incomplete information.
Resumo:
The “Nash program” initiated by Nash (Econometrica 21:128–140, 1953) is a research agenda aiming at representing every axiomatically determined cooperative solution to a game as a Nash outcome of a reasonable noncooperative bargaining game. The L-Nash solution first defined by Forgó (Interactive Decisions. Lecture Notes in Economics and Mathematical Systems, vol 229. Springer, Berlin, pp 1–15, 1983) is obtained as the limiting point of the Nash bargaining solution when the disagreement point goes to negative infinity in a fixed direction. In Forgó and Szidarovszky (Eur J Oper Res 147:108–116, 2003), the L-Nash solution was related to the solution of multiciteria decision making and two different axiomatizations of the L-Nash solution were also given in this context. In this paper, finite bounds are established for the penalty of disagreement in certain special two-person bargaining problems, making it possible to apply all the implementation models designed for Nash bargaining problems with a finite disagreement point to obtain the L-Nash solution as well. For another set of problems where this method does not work, a version of Rubinstein’s alternative offer game (Econometrica 50:97–109, 1982) is shown to asymptotically implement the L-Nash solution. If penalty is internalized as a decision variable of one of the players, then a modification of Howard’s game (J Econ Theory 56:142–159, 1992) also implements the L-Nash solution.
Resumo:
This paper explores how we may transform peoples’ perceived access to cultural participation by exploiting the possible relationships between place, play and mobile devices. It presents SCOOT; a location-based game in order to investigate how aspects of game-play can be employed to evoke at once playful and culturally meaningful experiences of place. In particular this paper is concerned with how the portable, communicative and social affordances of mobile phones are integral to making a “now everything looks like a game” experience.