An Axiomatic Characterization of Weighted Congestion Games

  • Vasily Gusev HSE University

Аннотация

In weighted congestion games, players’ weights and resource functions are predefined. This way, they can be applied for modeling traffic intensity, exploring market competition, and analyzing other problems with a congestion effect. In some normal-form games how ever, players’ weights and resource functions are not defined explicitly and players may be unaware of their existence. This article finds the necessary and sufficient conditions for representing a normal-form game as a weighted congestion game. Axioms are formulated that guarantee there exist positive weights of players and positive-definite resource functions. It is proved that a normal-form game satisfies the axioms of Positivity and the Independence of Irrelevant Choices (Konishi et al., 1997) if and only if it is a singleton weighted congestion game. This result indicates that the payoff functions of players in hedonic games are represented in the form of a weighted congestion game. It is demonstrated that a normal-form game satisfies the axioms of Non-Negativity, Transfer, Resource Marginal Contribution, and the Independence of Irrelevant Choices if and only if it is a full weighted congestion game with player-independent resource functions.

Скачивания

Данные скачивания пока не доступны.

Литература

Besner, M. (2019). Axiomatizations of the proportional Shapley value. Theory and Decision, 86(2), 161–183.

Bilò, V. (2007). On satisfiability games and the power of congestion games. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg., 231–240.

Bilò, V., Gourvès, L., & Monnot, J. (2023). Project games. Theoretical Computer Science, 940, 97–111.

Bogomolnaia, A., & Jackson, M. O. (2002). The stability of hedonic coalition structures. Games and Economic Behavior, 38(2), 201–230.

Chun, Y. (1989). A new axiomatization of the Shapley value. Games and Economic Behavior, 1(2), 119–130.

Dreze, J. H., & Greenberg, J. (1980). Hedonic coalitions: Optimality and stability. Economet

rica: Journal of the Econometric Society, 48(4), 987–1003.

Dubey, P., Einy, E., & Haimanko, O. (2005). Compound voting and the Banzhaf index. Games and Economic Behavior, 51(1), 20–30.

Einy, E., & Haimanko, O. (2011). Characterization of the Shapley–Shubik power index without the efficiency axiom. Games and Economic Behavior, 73(2), 615–621.

Gómez-Rúa, M., & Vidal-Puga, J. (2010). The axiomatic approach to three values in games with coalition structure. European Journal of Operational Research, 207(2), 795–806.

Gusev, V., Nesterov, A., Reshetov, M., & Suzdaltsev, A. (2024). The existence of a pure strategy Nash equilibrium in a discrete ponds dilemma. Games and Economic Behavior, 147, 38–51.

Hollard, G. (2000). On the existence of a pure strategy Nash equilibrium in group formation games. Economics Letters, 66(3), 283–287.

Kalai, E., & Samet, D. (1987). On weighted Shapley values. International Journal of Game Theory, 16(3), 205–222.

Konishi, H., Le Breton, M., & Weber, S. (1997a). Equilibria in a model with partial rivalry. Journal of Economic Theory, 72(1), 225–237.

Konishi, H., Le Breton, M., & Weber, S. (1997b). Equivalence of strong and coalition-proof Nash equilibria in games without spillovers. Economic Theory, 9, 97–113.

Mavronicolas, M., Milchtaich, I., Monien, B., & Tiemann, K. (2007). Congestion games with player-specific constants. Mathematical Foundations of Computer Science 2007: 32nd International Symposium, MFCS 2007 Česk` y Krumlov, Czech Republic, August 26-31, 2007 Proceedings 32, 633–644.

Milchtaich, I. (1996). Congestion games with player-specific payoff functions. Games and Economic Behavior, 13(1), 111–124.

Milchtaich, I. (2009). Weighted congestion games with separable preferences. Games and Economic Behavior, 67(2), 750–757.

Milchtaich, I. (2013). Representation of finite games as network congestion games. International Journal of Game Theory, 42, 1085–1096.

Milchtaich, I. (2021). Internalization of social cost in congestion games. Economic Theory, 71(2), 717–760.

Monderer, D. (2007). Multipotential games. Sangal R, Mehta H, Bagga RK, eds.Proc. 20nd Internat. Joint Conf. Artificial Intelligence (Morgan Kaufmann, San Francisco), 1422-1427.

Monderer, D., & Shapley, L. S. (1996). Potential games. Games and Economic Behavior, 14(1), 124–143.

Myerson, R. B. (1977). Graphs and cooperation in games. Mathematics of Operations Research, 2(3), 225–229.

Nowak, A. S., & Radzik, T. (1995). On axiomatizations of the weighted Shapley values. Games and Economic Behavior, 8(2), 389–405.

Rosenthal, R. W. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2, 65–67.

Shapley, L. S. (1971). Cores of convex games. International Journal of Game Theory, 1, 11–26.

Thomson, W. (2001). On the axiomatic method and its recent applications to game theory and resource allocation. Social Choice and Welfare, 18(2), 327–386.

Ui, T. (2000). A Shapley value representation of potential games. Games and Economic Behavior, 31(1), 121–135.

van den Brink, R., & Pinter, M. (2015). On axiomatizations of the Shapley value for assignment games. Journal of Mathematical Economics, 60, 110–114.

Young, H. P. (1985). Monotonic solutions of cooperative games. International Journal of Game Theory, 14(2), 65–72.

Zou, Z., van den Brink, R., Chun, Y., & Funaki, Y. (2021). Axiomatizations of the proportional division value. Social Choice and Welfare, 57, 35–62.

Опубликован
2025-06-16
Как цитировать
GusevV. (2025). An Axiomatic Characterization of Weighted Congestion Games. Препринты НИУ ВШЭ, 2(1). извлечено от https://preprint.hse.ru/article/view/27302