Performance of one-round walks in linear congestion games (Q647486): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-010-9309-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3155157870 / 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: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Selfish and Greedy Load Balancing / 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: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Approximation in Potential Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Speed of Convergence in Congestion Games under Best-Response Dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pure Nash Equilibria in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the Existence of Potential Functions in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic resource sharing in noncooperative networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for pure Nash equilibria in weighted congestion 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: Q3549719 / rank
 
Normal rank

Latest revision as of 16:55, 4 July 2024

scientific article
Language Label Description Also known as
English
Performance of one-round walks in linear congestion games
scientific article

    Statements

    Performance of one-round walks in linear congestion games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2011
    0 references
    0 references
    0 references