The coalitional Nash bargaining solution is defined to be the core allocation for which the Nash product is maximal. We consider a non-cooperative model in which one team may form. The grand team, consisting of all players, generates the largest surplus. But a smaller team may form. We show that as players get more patient if an efficient and stationary equilibrium exists, it must deliver payof...

To realize collaborative transmission in wireless overlay access networks, the question of rate allocation arises as how to divide the traffic flow among heterogeneous networks. Different networks role as game players and they try to transmit the traffic flow by a cooperative method. Power costs and transmission capabilities in heterogeneous networks are different according to terminal position...

In this paper, for evaluating the efficiency in a three-stage DEA structure we use additive and multiplicative cooperative models that comply with cooperation paradigm organizations, where improving of system, stages cooperate together. Since overall from may not be unique consequently stages’ efficiencies, then combine them Nash bargaining game approach besides maximizing scores whole provides...

Dynamic game theory is applied to analyze the timber market in northern Iran as a duopsony. The Nash equilibrium and the dynamic properties of the system based on marginal adjustments are determined. When timber is sold, the different mills use mixed strategies to give sealed bids. It is found that the decision probability combination of the different mills follow a special form of attractor an...

task graph scheduling is a multi-objective optimization and np-hard problem. in this paper a new algorithm on homogeneous multiprocessors systems is proposed. basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. these two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other on...

In Nash bargaining problem, due to fairness concern of players, instead of maximizing the sum of utilities of all players, an implementable solution should satisfy some axioms or characterizations. Such a solution can result in the so-called price of fairness, because of the reduction in the sum of utilities of all players. An important issue is to quantify the system efficiency loss under axio...

Demands and concessions in a multi-stage bargaining process are shaped by the probabilities that each side will prevail in an impasse. Standard game-theoretic predictions are quite sharp: demands are pushed to the precipice with nothing left on the table, but there is no conflict regardless of the degree of power asymmetry. Indeed, there is no delay in reaching an agreement that incorporates th...

This article by modeling a non-cooperative dynamic game tries to improve profitability and competition. This paper has considered how the manufacturer interacts with multiple competitor distributors. Each distributor also determines the optimal distribution price and inventory replenishment policies to maximize their profits. The issue form a non-cooperative dynamic game. Distributors formulate...

This research introduces endogenous codetermination in a Cournot duopoly. Unlike the received literature (Kraft, 1998), this work assumes that firms bargain with their own union bargaining units under if and only they can choose an ad hoc effort by maximising profits (three-stage non-cooperative game). There are remarkable differences compared main findings of exogenous literature. Indeed, ther...

This article is a brief survey on the Nash program for coalitional games. Results of noncooperative implementation of the Nash solution, the Shapley value and the core are discussed. Journal of Economic Literature classification: C7. Nash program In game theory this is the name given to a research agenda, initiated in Nash (1953), intended to bridge the gap between the cooperative and non-coope...