[HTML][HTML] The price of anarchy of affine congestion games with similar strategies

V Bilò, C Vinci - Theoretical Computer Science, 2020 - Elsevier
Affine congestion games are a well-studied model for selfish behavior in distributed systems,
such as transportation and communication networks. Seminal influential papers in …

Bounding the inefficiency of altruism through social contribution games

M Rahn, G Schäfer - International Conference on Web and Internet …, 2013 - Springer
We introduce a new class of games, called social contribution games (SCGs), where each
player's individual cost is equal to the cost he induces on society because of his presence …

Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond

K Takazawa - Discrete Applied Mathematics, 2025 - Elsevier
Congestion games offer a primary model in the study of pure Nash equilibria in non-
cooperative games, and a number of generalized models have been proposed in the …

On linear congestion games with altruistic social context

V Bilo - International Computing and Combinatorics …, 2014 - Springer
We study the issues of existence and inefficiency of pure Nash equilibria in linear
congestion games with altruistic social context, in the spirit of the model recently proposed …

Additively separable hedonic games with social context

G Monaco, L Moscardelli, Y Velaj - Games, 2021 - mdpi.com
In hedonic games, coalitions are created as a result of the strategic interaction of
independent players. In particular, in additively separable hedonic games, every player has …

Scheduling games with rank-based utilities

S Rosner, T Tamir - Games and Economic Behavior, 2023 - Elsevier
Job scheduling on parallel machines is a well-studied singleton congestion game. We
consider a variant of this game, arising in environments with strong competition. In a …

[PDF][PDF] Hedonic Games with Social Context.

G Monaco, L Moscardelli, Y Velaj - ICTCS, 2018 - ir.cwi.nl
Hedonic games are coalition formation games in which coalitions are created as a result of
the strategic interaction of independent players. To this day, the literature on non …

On the robustness of the approximate price of anarchy in generalized congestion games

V Bilò - International Symposium on Algorithmic Game Theory, 2016 - Springer
One of the main results shown through Roughgarden's notions of smooth games and robust
price of anarchy is that, for any sum-bounded utilitarian social function, the worst-case price …

On the robustness of the approximate price of anarchy in generalized congestion games

V Bilò - Theoretical Computer Science, 2022 - Elsevier
One of the main results shown through Roughgarden's notions of smooth games and
Robust Price of Anarchy is that, for any sum-bounded utilitarian social function, the worst …

Stable matching with network externalities

E Anshelevich, O Bhardwaj, M Hoefer - Algorithmica, 2017 - Springer
We study the stable roommates problem in networks where players are embedded in a
social context and may incorporate positive externalities into their decisions. Each player is …