Capacitated network design games (Q904684): 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-014-9540-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172882040 / 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: Q3579477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934597 / 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: Near-optimal network design with selfish agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Noncooperative Model of Network Formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish behavior in bilateral network formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in cost sharing connection games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph topologies in network routing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of best-response dynamics in games with conflicting congestion effects / 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: Network structure and strong equilibrium in route selection games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity allocation under noncooperative routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Conditions for Uniqueness of Equilibrium in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network topology and the efficiency of equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / 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 price of anarchy is independent of the network topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Cost Sharing for Resource Selection Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding the Braess paradox in non-cooperative networks / rank
 
Normal rank

Latest revision as of 07:28, 11 July 2024

scientific article
Language Label Description Also known as
English
Capacitated network design games
scientific article

    Statements

    Capacitated network design games (English)
    0 references
    0 references
    0 references
    13 January 2016
    0 references
    network design games
    0 references
    game theory
    0 references
    cost sharing
    0 references
    capacity
    0 references
    price of anarchy
    0 references
    price of stability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers