We show that the core of a continuous convex game on a measurable space of players is a von Neumann Morgenstern stable set. We also extend the definition of the Mas Colell bargaining set to games with a measurable space of players and show that for continuous convex games the core may be strictly included in the bargaining set but it coincides with the set of all countably additive payoff measu...

This thesis applies evolutionary algorithms to tackle bargaining games. Evolutionary algorithms can discover efficient and stationary strategies for various bargaining games. Game-theoretic method requires a substantial amount of mathematical reasoning. Thus this method restricts to simple problems. Moreover, game-theoretic solutions rest on the crucial assumption that every player is perfectly...

This note investigates the noncooperative foundations of von Neumann-Morgenstern (vN-M) stable sets in voting games. To do so, we study subgame perfect equilibria of a noncooperative legislative bargaining game, based on underlying simple games. The following results emerge from such an exercise: Every stable set of the underlying simple game is the limit set of undominated pure-strategy Markov...

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.

This paper considers the “negotiation game” (Busch and Wen [4]) which combines the features of two-person alternating offers bargaining and repeated games. Despite the forces of bargaining, the negotiation game in general admits a large number of equilibria some of which involve delay in agreement and inefficiency. In order to isolate equilibria in this game, we explicitly consider the complexi...

We treat a class of multi-person bargaining mechanisms based on games in coalitional form. For this class of games we identify properties of non-cooperative solution concepts, which are necessary and sufficient for the equilibrium outcomes to coincide with the core of the underlying coalitional form game. We view this result as a non-cooperative axiomatization of the core. In contrast to most o...

This paper is concerned with the question of defining the bargaining set, a cooperative game solution, when cooperation takes place in a dynamic setting. The focus is on dynamic cooperative games in which the players face (finite or infinite) sequences of exogenously specified TU-games and receive sequences of imputations against those static cooperative games in each time period. Two alternati...

We provide a model of coalitional bargaining with claims in order to solve games with non-transferable utilities and externalities. We show that, for each such game, payoff configurations exist which will not be renegotiated. In the ordinal game derived from these payoff configurations, we can find a partition in which no group of players has an incentive to jointly change their coalitions. For...

For two-person complete-information strategic games with transferable utility, all major variable-threat bargaining and arbitration solutions coincide. This confluence of solutions by luminaries such as Nash, Harsanyi, Raiffa, and Selten, is more than mere coincidence. Staying in the class of two-person games with transferable unility, the present paper presents a more complete theory that expa...

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 effici...