Abstract
Budget games are introduced by Drees, Feldotto, Riechers, and Skopalik (2015) as a model of noncooperative games arising from resource allocation problems. Budget games have several similarities to congestion games, one of which is that the matroid structure of the strategy space is essential for the existence of a pure Nash equilibrium (PNE). Despite these similarities, however, the theoretical relation between budget games and congestion games has been unclear. In this paper, we reveal the common structure of budget games and congestion games by providing a generalized model of budget games, called generalized budget games (g-budget games, for short). We show that the model of g-budget games includes weighted congestion games and player-specific congestion games under certain assumptions. We further show that g-budget games also include offset budget games, a generalized model of budget games by Drees, Feldotto, Riechers, and Skopalik (2019). We then prove that every matroid g-budget game has a PNE, which extends the result for budget games. We finally present a linear-time procedure to find a PNE in a certain class of singleton g-budget games.
The second author is partially supported by JSPS KAKENHI Grant Number JP20K11699, Japan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ackermann, H., Röglin, H., Vöcking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17), 1552–1563 (2009). https://doi.org/10.1016/j.tcs.2008.12.035
Drees, M., Feldotto, M., Riechers, S., Skopalik, A.: On existence and properties of approximate pure Nash equilibria in bandwidth allocation games. In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 178–189. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48433-3_14
Drees, M., Feldotto, M., Riechers, S., Skopalik, A.: Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37(2), 620–638 (2018). https://doi.org/10.1007/s10878-018-0269-7
Drees, M., Riechers, S., Skopalik, A.: Budget-restricted utility games with ordered strategic decisions. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 110–121. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44803-8_10
Fujishige, S., Goemans, M.X., Harks, T., Peis, B., Zenklusen, R.: Congestion games viewed from M-convexity. Oper. Res. Lett. 43(3), 329–333 (2015). https://doi.org/10.1016/j.orl.2015.04.002
Fujishige, S., Goemans, M.X., Harks, T., Peis, B., Zenklusen, R.: Matroids are immune to Braess’ paradox. Math. Oper. Res. 42(3), 745–761 (2017). https://doi.org/10.1287/moor.2016.0825
Harks, T., Klimm, M., Möhring, R.H.: Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42(2), 461–482 (2013). https://doi.org/10.1007/s00182-012-0322-1
Harks, T., Klimm, M., Peis, B.: Sensitivity analysis for convex separable optimization over integral polymatroids. SIAM J. Optim. 28(3), 2222–2245 (2018). https://doi.org/10.1137/16M1107450
Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124–143 (1996). https://doi.org/10.1006/game.1996.0044
Murota, K.: Discrete Convex Analysis. Society for Industrial and Applied Mathematics, Philadelphia (2003)
Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 65–67 (1973). https://doi.org/10.1007/BF01737559
Roughgarden, T.: Twenty Lectures on Algorithmic Game Theory. Cambridge University Press, Cambridge (2016)
Schrijver, A.: Combinatorial Optimization—Polyhedra and Efficiency. Springer, Heidelberg (2003)
Takazawa, K.: Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function. J. Comb. Optim. 38(4), 1043–1065 (2019). https://doi.org/10.1007/s10878-019-00435-9
Acknowledgements
The authors are grateful to the anonymous referees for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kiyosue, F., Takazawa, K. (2022). A Common Generalization of Budget Games and Congestion Games. In: Kanellopoulos, P., Kyropoulou, M., Voudouris, A. (eds) Algorithmic Game Theory. SAGT 2022. Lecture Notes in Computer Science, vol 13584. Springer, Cham. https://doi.org/10.1007/978-3-031-15714-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-15714-1_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15713-4
Online ISBN: 978-3-031-15714-1
eBook Packages: Computer ScienceComputer Science (R0)