Bargaining Dynamics in Exchange Networks

Details Bargaining Dynamics in Exchange Networks Bargaining Dynamics in Exchange Networks

2012-02-06

arxiv.org/abs/1202.1089v1

Computer Science

Computer Science and Game Theory

Short version appeared in Allerton 2010

Scientific paper

We consider a dynamical system for computing Nash bargaining solutions on graphs and focus on its rate of convergence. More precisely, we analyze the edge-balanced dynamical system by Azar et al and fully specify its convergence for an important class of elementary graph structures that arise in Kleinberg and Tardos' procedure for computing a Nash bargaining solution on general graphs. We show that all these dynamical systems are either linear or eventually become linear and that their convergence times are quadratic in the number of matched edges.

Affiliated with

Also associated with

No associations

Rating

Bargaining Dynamics in Exchange Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bargaining Dynamics in Exchange Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bargaining Dynamics in Exchange Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-119203