Improved bounds on equilibria solutions in the network design game (Q1757081): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q260253
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Matúš Mihalák / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CGAL / 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/s00182-017-0600-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2768332442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call control in rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logit-response dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sequential price of anarchy of isolation 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: Computing on an anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the price of stability of undirected network design games / rank
 
Normal rank
Property / cites work
 
Property / cites work: When ignorance helps: graphical multicast cost sharing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of stability for undirected broadcast network design with fair cost allocation is constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Price of Stability for Undirected Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ring design game with fair cost allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria with minimum potential in undirected broadcast games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The curse of simultaneity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank

Latest revision as of 18:20, 17 July 2024

scientific article
Language Label Description Also known as
English
Improved bounds on equilibria solutions in the network design game
scientific article

    Statements

    Improved bounds on equilibria solutions in the network design game (English)
    0 references
    0 references
    0 references
    0 references
    28 December 2018
    0 references
    network design game
    0 references
    Nash equilibrium
    0 references
    price of stability
    0 references
    ring topology
    0 references
    potential-optimum price of stability/anarchy
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references