Negotiation-proof correlated equilibrium

This article characterizes the set of correlated equilibria that result from open negotiations, which players make prior to playing a strategic game. A negotiation-proof correlated equilibrium is defined as a correlated strategy in which the negotiation process among all of the players prevents the formation of any improving coalitional deviation. Additionally, this notion of equilibrium is adapted to general games with incomplete information.Correlated equilibrium, coalitions, negotiation, incomplete information

Complexity and Efficiency in Repeated Games with Negotiation

This paper considers the "negotiation game" (Busch and Wen, 1995) 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 complexity of implementing a strategy, introduced in the literature on repeated games played by automata. It turns out that when the players have a preference for less complex strategies (even at the margin) only efficient equilibria survive. Thus, complexity and bargaining in tandem may offer an explanation for co-operation in repeated gamesNegotiation Game, Repeated Game, Bargaining, Complexity, Bounded Rationality, Automaton

Complexity and Efficiency in Repeated Games with Negotiation

This paper considers the "negotiation game" (Busch and Wen, 1995) 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 complexity of implementing a strategy, introduced in the literature on repeated games played by automata. It turns out that when the players have a preference for less complex strategies (even at the margin) only efficient equilibria survive. Thus, complexity and bargaining in tandem may offer an explanation for co-operation in repeated gamesNegotiation Game, Repeated Game, Bargaining, Complexity, Bounded Rationality, Automaton

The Time-Preference Nash Solution

We give an axiomatic characterization of the Time-Preference Nash Solution, a bargaining solution that is applied when the underlying preferences are defined over streams of physical outcomes. This bargaining solution is similar to the ordinal Nash solution introduced by Rubinstein, Safra and Thomson (1992), but it gives a different prediction when the set of physical outcomes is a set of lotteries.bargaining, ordinal Nash solution.

The time-preference Nash solution

We give an axiomatic characterization of the Time-Preference Nash Solution, a bargaining solution that is applied when the underlying preferences are defined over streams of physical outcomes. This bargaining solution is similar to the ordinal Nash solution introduced by Rubinstein, Safra, and Thomson (1992), but it gives a different prediction when the set of physical outcomes is a set of lotteries.

Complexity and Efficiency in the Negotiation Game

This paper considers the ``negotiation game'' Busch and Wen (1995)) 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 and inefficiency. In order to isolate equilibria in this game, we investigate the role of complexity of implementing a strategy, introduced in the literature on repeated games played by automata. It turns out that when the players care for less complex strategies (at the margin) only efficient equilibria survive. Thus, complexity and bargaining in tandem may offer an explanation for co-operation and efficiency in repeated gamesBargaining, Repeated Game, Negotiation Game, Complexity, Automaton

Pareto-optimal algorithm in bilateral automated negotiation

In this paper we present a Pareto-optimal algorithm in bilateral automated negotiation where the negotiation is modeled by "split the pie" game and alternating-offer protocol. Pareto-optimality is the seminal condition in the bargaining problem which leads autonomous agents to the Nash-equilibrium. Generating Pareto-optimal offer in multi-issue bargaining is a computationally complex problem, specially, when autonomous agents have incomplete information about deadline, outside options and the opponent's preferences. Unfortunately, yet to date, there is no articulation that clearly describes an algorithm to generate offer in multi-issue negotiation with perfect information. To this end, we present the maximum greedy trade-offs (MGT) algorithm that generate offers at any aspiration-level in O(n) with assuming that the order of greedy choices is given, otherwise the complexity will be O(n bg n). We also provide analytical proof for the correctness of the maximum greedy trade-offs algorithm

A Theory of Negotiations and Formation of Coalitions

This paper proposes a new solution concept to three-player coalitional bargaining problems where the underlying economic opportunities are described by a partition function. This classic bargaining problem is modeled as a dynamic non-cooperative game in which players make conditional or unconditional offers, and coalitions continue to negotiate as long as there are gains from trade. The theory yields a unique stationary perfect equilibrium outcome-the negotiation value-and provide a unified framework that selects an economically intuitive solution and endogenous coalition structure. For such games as pure bargaining games the negotiation value coincides with the Nash bargaining solution, and for such games as zero-sum and majority voting games the negotiation value coincides with the Shapley value. However, a novel situation arises where the outcome is determined by pairwise sequential bargaining sessions in which a pair of players forms a natural match. In addition, another novel situation exists where the outcome is determined by one pivotal player bargaining unconditionally with the other players, and only the pairwise coalitions between the pivotal player and the other players can form.