Reducibility among fractional stability problems

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

Volumn , Issue , 2009, Pages 283-292

  Kintali, Shiva ^a   Poplawski, Laura J ^b   Rajaraman, Rajmohan ^b   Sundaram, Ravi ^b   Teng, Shang Hua ^c  

^a Georgia Institute of Technology   (United States)

^b Northeastern University   (United States)

^c University of Southern California ^*  (United States)

Author keywords

Complexity theory; Game theory; Stability

Indexed keywords

ALGORITHMIC GAME THEORY; COMBINATORICS; COMPLETE PROBLEMS; COMPLEXITY THEORY; CONNECTION GAMES; EXPONENTIAL NUMBERS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; HYPERGRAPH; INTERNET ROUTING; LINEAR PROGRAMS; NASH EQUILIBRIA; NEW CONCEPT; OPEN PROBLEMS; PREFERENCE SYSTEMS; SOCIAL CHOICE; SOCIAL NETWORKS; STABILITY PROBLEM; TECHNICAL NOTES;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION; SYSTEM STABILITY;

GAME THEORY;

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

References (38)

1. R. Aharoni and T. Fleiner, "On a lemma of Scarf," Journal of Combinatorial Theory, Series B, vol. 87(1), pp. 72-80, 2003.
2. R. Aharoni and R. Holzman, "Fractional Kernels in Digraphs," Journal of Combinatorial Theory, Series B, vol. 73(1), pp. 1-6, 1998.
3. R. J. Aumann, "Subjectivity and correlation in randomized strategies." Journal of Mathematical Economics, vol. 1, pp. 67-96, 1974.
4. O. Bondareva., "Some applications of linear programming to cooperative games." Problemy Kibernetiki, vol. 10, pp. 119-139, 1963.
5. X. Chen and X. Deng, "3-NASH is PPAD-complete," Electronic Colloquium on Computational Complexity (ECCC), vol. 134, 2005.
6. -, "Settling the complexity of two-player Nash equilibrium," FOCS, pp. 261-272, 2006.
7. X. Chen, X. Deng, and S.-H. Teng, "Computing Nash equilibria: Approximation and smoothed complexity," FOCS, pp. 603-612, 2006.
8. -, "Settling the complexity of computing two-player Nash equilibria." Journal of the ACM (JACM), vol. 56(3), 2009.
9. V. Conitzer and T. Sandholm, "Complexity of determining nonemptiness of the core." EC, pp. 230-231, 2003.
10. -, "Complexity of constructing solutions in the core based on synergies among coalitions." Artificial Intelligence, vol. 170(6), pp. 607-619, 2006.
11. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, "The complexity of computing a Nash equilibrium," STOC, pp. 71-78, 2006.
12. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou., "The complexity of computing a Nash equilibrium." 2008, invited to SiCOMP.
13. Q. Fang, R. Fleischer, J. Li, and X. Sun, "Algorithms for core stability, core largeness, exactness, and extendability of flow games." 13th Annual International Computing and Combinatorics Conference, 2007.
14. D. Gale and L. S. Shapley, "College admissions and the stability of marriage," American Mathematical Monthly, vol. 69, pp. 9-14, 1962.
15. R. Garg, V. Kumar, A. Rudra, and A. Verma, "Coalitional games on graphs: core structure, substitutes and frugality." EC, pp. 248-289, 2003.
16. P. W. Goldberg and C. H. Papadimitriou, "Reducibility among equilibrium problems," STOC, pp. 61-70, 2006.
17. T. G. Griffin, F. B. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Transactions on Networking, vol. 10(2), pp. 232-243, 2002.
18. P. E. Haxell and G. T. Wilfong, "A fractional model of the Border Gateway Protocol (BGP)," SODA, pp. 193-199, 2008.
19. -, "On the Stable Paths Problem," 2008, preprint.
20. N. Immorlica, K. Jain, and M. Mahdian, "Game-theoretic aspects of designing hyperlink structures." WINE, vol. 4286, pp. 150-161, 2006.
21. M. Kearns, M. L. Littman, and S. Singh., "Graphical models for game theory." 17th Conference in Uncertainty in Artificial Intelligence, pp. 253-260, 2001.
22. S. Kintali, "A Distributed Protocol for Fractional Stable Paths Problem," Georgia Tech, College of Computing Technical Report GT-CS-08-06; Presented at the DIMACS/DyDAn Workshop on Secure Internet Routing, Rutgers University, March 24-26 2008.
23. S. Kintali, L. J. Poplawski, R. Rajaraman, R. Sundaram, and S.-H. Teng, "Reducibility among fractional stability problems," arXiv:0904.1435v1 [cs.CC], 2009.
24. T. Király and J. Pap, "Kernels, stable matchings, and Scarf's lemma," The Egerváry Research Group Technical Report TR-2008-13, http://www.cs.elte.hu/egres/tr/egres-08-13.pdf.
25. M. Kumabe and H. R. Mihara, "Computability of simple games: A characterization and application to the core." arXiv:0705.3227v2, 2007.
26. N. Laoutaris, L. J. Poplawski, R. Rajaraman, R. Sundaram, and S.-H. Teng, "Bounded budget connection (BBC) games or how to make friends and influence people, on a budget." PODC, pp. 165-174, 2008.
27. E. Markakis and A. Saberi., "On the core of the multicommodity flow game." EC, pp. 93-97, 2003.
28. N. Megiddo and C. H. Papadimitriou, "On total functions, existence theorems and computational complexity," Theoretical Computer Science, vol. 81(2), pp. 317-324, 1991.
29. J. Nash., "Equilibrium point in n-person games." PNAS, vol. 36(1), pp. 48-49, 1950.
30. -, "Noncooperative games." Annals of Mathematics, vol. 54, pp. 286-295, 1951.
31. N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani, Algorithmic Game Theory. Cambridge University Press, 2007.
32. C. H. Papadimitriou, "On the complexity of the parity argument and other inefficient proofs of existence," Journal of Computer and System Sciences, vol. 48(3), pp. 498-532, 1994.
33. Y. Rehkter and T. Li, "A Border Gateway Protocol (BGP version 4) RFC 1771," 1995.
34. H. E. Scarf, "The Core of an N Person Game," Econometrica, vol. 69, p. 35:50, 1967.
35. L. S. Shapley., "On balanced sets and cores." Naval Research Logistics Quarterly, vol. 14, pp. 453-460, 1967.
36. J. W. Stewart, BGP4: Inter-domain routing in the Internet. Addison Wesley, 1998.
37. M. J. Todd., "Orientation in complementary pivot algorithms." Mathematics of Operations Research, vol. 1(1), pp. 54-66, 1976.
38. K. Varadhan, R. Govindan, and D. Estrin, "Persistent route oscillations in inter-domain routing," Computer Networks, vol. 32, pp. 1-16, 2000.