Congestion games with capacitated resources (Q904685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jérôme Monnot / rank
Normal rank
 
Property / author
 
Property / author: Jérôme Monnot / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-014-9541-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154639153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Congestion Games and Two-Sided Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy of finite congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence time to Nash equilibrium in load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure and complexity of Nash equilibria for a selfish routing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria for scheduling on restricted parallel links / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion Games with Capacitated Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3109944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points in <i>n</i> -person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The college admissions problem is not equivalent to the marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic game theory. 5th international symposium, SAGT 2012, Barcelona, Spain, October 22--23, 2012. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:28, 11 July 2024

scientific article
Language Label Description Also known as
English
Congestion games with capacitated resources
scientific article

    Statements

    Congestion games with capacitated resources (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    congestion games
    0 references
    pure Nash equilibrium
    0 references
    potential function
    0 references
    algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references