Convergence of local dynamics to balanced outcomes in exchange networks

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 293-302

  Azar, Yossi ^a   Birnbaum, Benjamin ^b   Celis, L Elisa ^b   Devanur, Nikhil R ^a   Peres, Yuval ^a  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCING DYNAMICS; BARGAINING GAME; EXCHANGE NETWORKS; LOCAL DYNAMICS; POLYNOMIAL-TIME ALGORITHMS;

FIBER OPTIC CHEMICAL SENSORS;

COMPUTER SCIENCE;

EID: 77952364899     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.33     Document Type: Conference Paper

References (20)

1. H. Ackermann, P. W. Goldberg, V. S. Mirrokni, H. Roglin, and B. Vocking, "Uncoordinated two-sided matching markets," in ACM Conference on Electronic Commerce, 2008, pp. 256-263.
2. B. Awerbuch, Y. Azar, A. Epstein, V. S. Mirrokni, and A. Skopalik, "Fast convergence to nearly optimal solutions in potential games," in ACM Conference on Electronic Commerce, 2008, pp. 264-273.
3. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," in International Symposium on Information Theory, 2005, pp. 1763-1767.
4. M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, "On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs," Journal of Statistical Mechanics: Theory and Experiment, 2008. [Online]. Available: http://arxiv.org/PS-cache/arxiv/pdf/0807/ 0807.3159v1.pdf
5. D. P. Bertsekas, "Auction algorithms," in Encyclopedia of Optimization, 2009, pp. 128-132.
6. S. Chien and A. Sinclair, "Convergence to approximate nash equilibria in congestion games," in SODA, 2007, pp. 169-178.
7. K. S. Cook and R. M. Emerson, "Power, equity, and commitment in exchange networks," American Sociological Review, vol. 43, no. 5, pp. 721-739, Oct 1978.
8. K. S. Cook, R. M. Emerson, M. R. Gillmore, and T. Yamagishi, "The distribution of power in exchange networks: Theory and experimental results," American Journal of Sociology, vol. 89, pp. 275-305, 1983.
9. K. S. Cook and T. Yamagishi, "Power in exchange networks: A power-dependence formulation," Social Networks, vol. 14, pp. 245-265, 1992.
10. M. Corominas-Bosch, "Bargaining in a network of buyers and sellers," Journal of Economic Theory, vol. 115, no. 1, pp. 35-77, 2004.
11. T. S. Driessen, "A note on the inclusion of the kernel in the core of the bilateral assignment game," International Journal of Game Theory, vol. 27, 1998.
12. D. Gale and L. S. Shapley, "College admissions and the stability of marriage," The American Mathematical Monthly, vol. 69, no. 1, pp. 9-15, 1962.
13. J. Kleinberg and E. Tardos, "Balanced outcomes in social exchange networks," Symposium on Theory of Computing, 2008. [Online]. Available: http://www.cs.cornell.edu/home/kleinber/stoc08-exchange.pdf
14. J. Nash, "The bargaining problem," Econometrica, vol. 18, pp. 155-162, 1950.
15. S. C. Rochford, "Symmetrically pairwise-bargained allocations in an assignment market," Journal of Economic Theory, vol. 34, no. 2, pp. 262-281, 1984.
16. R. Rosenthal, "A class of games possessing pure-strategy Nash equilibria," International Journal of Game Theory, vol. 2, pp. 65-67, 1973.
17. A. E. Roth and M. A. Oliveira, Two-sided matching: A study in game-theoretic modeling and analysis, 1990.
18. S. Sanghavi, D. M. Malioutov, and A. S. Willsky, "Linear programming analysis of loopy belief propagation for weighted matching," NIPS, 2007.
19. L. S. Shapley and M. Shubik, "The assignment game I: The core," International Journal of Game Theory, vol. 1, no. 2, pp. 111-130, 1972.
20. D. Willer, Ed., Network Exchange Theory. Praeger, 1999.