Minimizing Rosenthal potential in multicast games (Q493648): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60488394, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Value of Coordination in Network Design / 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: Q3002793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Network Protocols for Good Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search: is brute-force avoidable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation via cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-sharing mechanisms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4758141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical aspects of local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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: Quantifying inefficiency in cost-sharing mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT / rank
 
Normal rank

Latest revision as of 17:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Minimizing Rosenthal potential in multicast games
scientific article

    Statements

    Minimizing Rosenthal potential in multicast games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 September 2015
    0 references

    Identifiers

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