Dynamics of profit-sharing games

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 37-42

  Augustine, John ^a   Chen, Ning ^a   Elkind, Edith ^a   Fanelli, Angelo ^a   Gravin, Nick ^a   Shiryaev, Dmitry ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED RATIONALITY; COALITION FORMATIONS; CONCAVE FUNCTION; MARGINAL UTILITY; NASH EQUILIBRIA; POLYNOMIAL NUMBER; PRICE OF ANARCHY; PRICE OF STABILITY;

MULTI AGENT SYSTEMS; PROFITABILITY;

WAGES;

EID: 80055076000     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-018     Document Type: Conference Paper

References (22)

1. Ackermann, H., Röglin, H., and Vöcking, B. (2008). On the impact of combinatorial structure on congestion games. J. ACM, 55(6).
2. Airiau, S. and Sen, S. (2009). A fair payoff distribution for myopic rational agents. In AAMAS, pages 1305-1306.
3. Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V. S., and Skopalik, A. (2008). Fast convergence to nearly optimal solutions in potential games. In EC, pages 264-273.
4. Bhalgat, A., Chakraborty, T., and Khanna, S. (2010). Approximating pure Nash equilibrium in cut, party affiliation, and satisfiability games. In EC, pages 73-82.
5. Chalkiadakis, G. and Boutilier, C. (2004). Bayesian reinforcement learning for coalition formation under uncertainty. In AAMAS, pages 1090-1097.
6. Chatterjee, K., Dutta, B., Ray, D., and Sengupta, K. (1993). A noncooperative theory of coalitional bargaining. Review of Economic Studies, 60(2):463-77.
7. Chien, S. and Sinclair, A. (2007). Convergence to approximate Nash equilibria in congestion games. In SODA, pages 169-178.
8. Deng, X. and Papadimitriou, C. H. (1994). On the complexity of cooperative solution concepts. Math. Oper. Res., 19:257-266.
9. Dieckmann, T. and Schwalbe, U. (2002). Dynamic coalition formation and the core. Journal of Economic Behavior and Organization, 49:363-380.
10. Fabrikant, A., Papadimitriou, C. H., and Talwar, K. (2004). The complexity of pure Nash equilibria. In STOC, pages 604-612.
11. Fanelli, A., Flammini, M., and Moscardelli, L. (2008). The speed of convergence in congestion games under best-response dynamics. In ICALP (1), pages 796-807.
12. Gairing, M. and Savani, R. (2010). Computing stable outcomes in hedonic games. In SAGT, pages 174-185.
13. Gairing, M. and Savani, R. (2011). Computing stable outcomes in hedonic games with voting-based deviations. In AAMAS, to appear.
14. Moldovanu, B. and Winter, E. (1995). Order independent equilibria. Games and Economic Behavior, 9(1):21-34.
15. Monderer, D. and Shapley, L. S. (1996). Potential games. Games and Economic Behavior, 14(1):124-143. (Pubitemid 126164246)
16. Rosenthal, R. W. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67.
17. Sandholm, T. and Lesser, V. (1997). Coalitions among computationally bounded agents. Artif. Intell., 94:99-137. (Pubitemid 127371448)
18. Schäffer, A. A. and Yannakakis, M. (1991). Simple local search problems that are hard to solve. SIAM J. Comput., 20(1):56-87.
19. Shapley, L. S. (1953). A value for n-person games. Contributions to the theory of games, 2:307-317.
20. Shehory, O. and Kraus, S. (1999). Feasible formation of coalitions among autonomous agents in nonsuperadditve environments. Comp. Intell., 15:218-251.
21. Skopalik, A. and Vöcking, B. (2008). Inapproximability of pure Nash equilibria. In STOC, pages 355-364.
22. Yan, H. (2003). Noncooperative selection of the core. International Journal of Game Theory, 31:527-540.