Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  extend congestion games to the setting where every resource is endod with a capacity which possibly limits its number of users. From the negative side,  show that a pure Nash equilibrium is not guaranteed to exist in any case and  prove that deciding whether a game possesses a pure Nash equilibrium is NP-complete. Our positive results state that congestion games with capacities are potential games in the ll studied singleton case. Polynomial algorithms that compute these equilibria are also provided.
['Laurent Gourvès', 'Jérôme Monnot', 'Stefano Moretti', 'Nguyen Kim Thang']
I am writing a research paper on a idea Congestion Games with Capacitated Resources
[{"from": "human", "value": "I am writing a research paper on a idea Congestion Games with Capacitated Resources"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  extend congestion games to the setting where every resource is endod with a capacity which possibly limits its number of users. From the negative side,  show that a pure Nash equilibrium is not guaranteed to exist in any case and  prove that deciding whether a game possesses a pure Nash equilibrium is NP-complete. Our positive results state that congestion games with capacities are potential games in the ll studied singleton case. Polynomial algorithms that compute these equilibria are also provided."}]