Two bargaining parties play the Nash Demand Game to share a pie whose size is determined by one party's investment decision. Various investment levels are subgame-perfect. Adding the investment decision to Young's evolutionary bargaining model yields the following long-run outcome: efficient investment prevails and the investor's share of the pie approximates die maximum of (i) the smallest sha...

This paper presents supplier-buyer models to describe the bargaining process between a supplier and a buyer over a long-term replenishment contract in a supply chain system. We develop two different models, one for the situation where the supplier has a superior bargaining power over the buyer and the other for the reverse situation. Analysis based on a game theoretic approach is done to derive...

We propose a variation of the non-cooperative bargaining model for n-person games in coalitional form, introduced in Hart and Mas-Colell (1996). This strategic game implements, in the limit, a new NTU-value for the class of monotonic games. This value coincides with the Consistent NTU-value (Maschler and Owen,1989) for hyperplane games, and with the Shapley value for TU games (Shapley, 1953). T...

In this work we propose an agent based model where a fixed finite population of tagged agents play iteratively the Nash demand game in a regular lattice. This work extends the multiagent bargaining model by [1] including the spatial dimension in the game. Each agent is endowed with memory and plays the best reply against the opponent's most frequent demand. The results show that all the possibl...

February 1997 Final Version: October 15, 2001 This paper provides simple four-stage game forms that fully implement a large class of two-person bargaining solutions in subgame-perfect equilibrium. The solutions that can be implemented by our game forms are those that maximize a monotonic and quasi-concave function of utilities after normalizing each agent's utility function so that the maximum ...

The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, we propose a solution from cooperative game theory based on the concept of Nash Bargaining Solution. The proposed game theoretical technique is compared ag...

The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...

In this paper we formulate the static load balancing problem in single class job distributed systems as a cooperative game among computers. It is shown that the Nash Bargaining Solution (NBS) provides a Pareto optimal allocation which is also fair to all jobs. We propose a cooperative load balancing game and present the structure of the NBS. For this game an algorithm for computing NBS is deriv...

The high cost associated with the rollout of 3G services encourages operators to share network infrastructure. Network sharing poses a new challenge in devising fair, efficient and Pareto optimal resource allocation strategies to distribute system resources among users of different operators in the network. Cooperative game theory provides a framework for formulating such strategies. In this pa...