Core Stability of Minimum Coloring Games

References

• Ambühl A. Paffenholz, Schurr I., Welzl E. (2004) . Personal communication at 2nd Gremo’s Workshop on Open Problems (GWOP), Cumpadials, Switzerland, JulyGoogle Scholar
• Bietenhader Y. Okamoto. Core stability of minimum coloring games. Proc. 30th WG, Lecture Notes in Comput. Science (2004) Vol. 3353(Springer, Berlin, Germany) 389–401Google Scholar
• Biswas A. K., Parthasarathy T., Potters J. A. M., Voorneveld M. Large cores and exactness. Games Econom. Behavior (1999) 28:1–12Crossref, Google Scholar
• Chudnovsky M., Cornuéjols G., Liu X., Seymour P., Vušković K. Recognizing Berge graphs. Combinatorica (2005) 25:143–186Crossref, Google Scholar
• Cook S. A. The complexity of theorem proving procedure. Proc. 3rd Annual ACM Sympos. Theory of Computing (STOC) (1971) (ACM, New York) 151–158Google Scholar
• Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. (1990) 9:251–280Crossref, Google Scholar
• Corneil D. G., Perl Y. Clustering and domination in perfect graphs. Discrete Appl. Math. (1984) 9:27–39Crossref, Google Scholar
• Curiel I. J.Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Crossref, Google Scholar
• Deng X., Papadimitriou Ch. H. On the complexity of cooperative solution concepts. Math. Oper. Res. (1994) 19:257–266Link, Google Scholar
• Deng X., Ibaraki T., Nagamochi H. Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. (1999) 24:751–766Link, Google Scholar
• Deng X., Ibaraki T., Nagamochi H., Zang W. Totally balanced combinatorial optimization games. Math. Programming (2000) 87:441–452Crossref, Google Scholar
• Farber M. Independent domination in chordal graphs. Oper. Res. Lett. (1982) 1:134–138Crossref, Google Scholar
• Fulkerson D. R., Gross O. A. Incidence matrices and interval graphs. Pacific J. Math. (1995) 15:835–855Crossref, Google Scholar
• Garey M. R., Johson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman & Co., New York) Google Scholar
• Gillies D. B. Some theorems on n-person games. (1953) . Ph.D. thesis, Princeton University, Princeton, NJGoogle Scholar
• Grötschel M., Lovász L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1993) 2nd ed.(Springer-Verlag, Berlin, Germany) Crossref, Google Scholar
• Kratsch D., Haynes T. W., Hedetniemi S. T., Slater P. J. Algorithms. Domination in Graphs (Advanced Topics) (1998) (Marcel Dekker Inc., New York) 191–231Google Scholar
• Kratsch D., Stewart L. Domination on cocomparability graphs. SIAM J. Discrete Math. (1993) 6:400–417Crossref, Google Scholar
• Levin L. Universal search problems. Problemy Peredachi Informatsii (1973) 9:265–266(in Russian)Google Scholar
• Lovász L. Normal hypergraphs and the perfect graph conjecture. Discrete Math. (1972) 2:253–267Crossref, Google Scholar
• Makino K., Uno T. New algorithms for enumerating all maximal cliques. Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT), Lecture Notes in Computer Science (2004) 3111(Springer, Berlin, Germany) 260–272Google Scholar
• Miller R. E., Muller D. E. A problem of maximum consistent subsets. (1960) . Research report RC-240, IBM Research Center, New YorkGoogle Scholar
• Moon J. W., Moser L. On cliques in graphs. Israel J. Math. (1965) 3:23–28Crossref, Google Scholar
• Okamoto Y. Fair cost allocations under conflicts—A game-theoretic point of view. Proc. 14th Internat. Sympos. on Algorithms and Comput.(ISAAC), Lecture Notes in Computer Science (2003) 2906(Springer, Berlin, Germany) 686–695Google Scholar
• Okamoto Y. Submodularity of some classes of the combinatorial optimization games. Math. Methods Oper. Res. (2003) 58:131–139Crossref, Google Scholar
• Schmeidler D. Cores of exact games, I. J. Math. Anal. Appl. (1972) 40:214–225Crossref, Google Scholar
• Shapley L. S. Cores of convex games. Internat. J. Game Theory (1972) 1:11–26Errata. Internat. J. Game Theory 1 199Crossref, Google Scholar
• Sharkey W. W. Cooperative games with large cores. Internat. J. Game Theory (1982) 11:175–182Crossref, Google Scholar
• Solymosi T., Raghavan T. E. S. Assignment games with stable cores. Internat. J. Game Theory (2001) 30:177–185Crossref, Google Scholar
• van Gellekom J. R. G., Potters J. A. M., Reijnierse J. H. Prosperity properties of TU-games. Internat. J. Game Theory (1999) 28:211–227Crossref, Google Scholar
• von Neumann J., Morgenstern O.Theory of Games and Economic Behaviour (1944) (Princeton University Press, Princeton, NJ) Google Scholar
• West D. B.Introduction to Graph Theory (2000) 2nd ed.(Prentice Hall, Upper Saddle River, NJ) Google Scholar
• Woeginger G. J. Exact algorithms for NP-hard problems: A survey. Combinatorial Optimization—Eureka! You shrink!, Lecture Notes in Computer Science (2003) 2570(Springer, Berlin, Germany) 185–207Crossref, Google Scholar
• Woeginger G. J. Space and time complexity of exact algorithms: Some open problems. Proc. 1st International Workshop on Parameterized and Exact Computation (IWPEC), Bergen, Norway, Lecture Notes in Computer Science (2004) 3762(Springer, Berlin, Germany) 281–290Google Scholar
• Zverovich I. E. Independent domination on 2P3-free perfect graphs. (2003) . DIMACS Technical report 2003-22 http://dimacs.rutgers.edu/TechnicalReports/abstracts/2003/2003-22.htmlGoogle Scholar