نتایج جستجو برای: Bargaining Games
تعداد نتایج: 62471 فیلتر نتایج به سال:
Even with complete information, two-person bargaining can generate a large number of equilibria, involving disagreements and inefficiencies, in (i) negotiation games where disagreement payoffs are endogenously determined (Busch and Wen [4]) and (ii) costly bargaining games where there are transaction/participation costs (Anderlini and Felli [2]). We show that when the players have (at the margi...
Recently, [8] defined the class of Linear Nash Bargaining Games (LNB) and obtained combinatorial, polynomial time algorithms for several games in this class. [8] also defines two natural subclasses within LNB, UNB and SNB, which contain a number of natural Nash bargaining games. In this paper we define three basic game theoretic properties of Nash bargaining games: price of bargaining, fairness...
in this paper, we analyze the effect of lack of capital investment on energy projects using game theory in the guise of cooperative games. we focus on the energy projects in the provincial level as case study during 2010-2011. therefore, we design a theoretical model of the lack of capital investment as a factor influencing the implement of energy projects. in the experimental section, we deter...
Bargaining Power is one of the important issues in oil trade negotiations. In this paper two effective factors in bargaining power i.e. patient time to deal and outside options of each player have been considered. The necessary relations for exchange of sources in negotiation have been derived.
The semireactive bargaining set, a solution for cooperative games, is introduced. This solution is in general a subsolution of the bargaining set and a supersolution of the reactive bargaining set. However, on various classes of transferable utility games the semireactive and the reactive bargaining set coincide. The semireactive prebargaining set on TU games can be axiomatized by one-person ra...
A class of bargaining games in which agents bargain over prices and maximum trading constraints is considered: It is proved that all the Stationary Subgame Perfect Equilibria of these games implement Walrasian allocations as the bargaining frictions vanish. The result holds for any number of agents and is robust to different specifications of the bargaining process. © 2011 Published by Elsevier...
The cooperative solution concept introduced here, the demand bargaining set, contains the core and is included in the Zhou bargaining set, eliminating the “dominated” coalition structures. The demand vectors belonging to the demand bargaining set are self-stable. In the class of constant-sum homogeneous weighted majority games the demand bargaining set is non-empty and predicts a unique demand ...
We initiate a study of Nash bargaining games [Nas50] via combinatorial, polynomial time algorithms and we carry this program over to solving nonsymmetric bargaining games of Kalai [Kal77] as well. Since the solution to a Nash bargaining game is also the optimal solution to the corresponding convex program, this involves obtaining a combinatorial algorithm for the latter. This in turn can be vie...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید