Local Dynamics in Bargaining Networks via Random-Turn Games
نویسندگان
چکیده
We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to optimal play in a randomturn game. We analyze this game using techniques from martingale and Markov chain theory. We obtain a tight polynomial bound on the rate of convergence for a nontrivial class of unweighted graphs (the previous known bound was exponential). Additionally, we show this technique extends naturally to many other graphs and dynamics.
منابع مشابه
Transfer of Bargaining Power Sources in Oil Trade Games
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.
متن کاملEquilibrium selection in bargaining models
This paper examines evolutionary equilibrium selection in bargaining models. We show that random best-response and continuous best-response learning dynamics give rise to (different) simple sufficient conditions for identifying outcomes as stochastically stable. This allows us to characterize the implications of these dynamics in simple bargaining games. 2003 Elsevier Inc. All rights reserved...
متن کاملA Natural Dynamics for Bargaining on Exchange Networks
Bargaining networks model the behavior of a set of players that need to reach pairwise agreements for making profits. Nash bargaining solutions are special outcomes of such games that are both stable and balanced. Kleinberg and Tardos proved a sharp algorithmic characterization of such outcomes, but left open the problem of how the actual bargaining process converges to them. A partial answer w...
متن کاملNash Bargaining Via Flexible Budget Markets
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...
متن کاملar X iv : c s / 06 04 07 5 v 2 [ cs . M A ] 2 8 Ju l 2 00 6 Naming Games in Spatially - Embedded Random Networks ∗
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a ...
متن کامل