Selfish bin coloring (Q411255): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A46 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C33 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6021878 / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithmic game theory
Property / zbMATH Keywords: algorithmic game theory / rank
 
Normal rank
Property / zbMATH Keywords
 
bin coloring
Property / zbMATH Keywords: bin coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
Nash equilibria
Property / zbMATH Keywords: Nash equilibria / rank
 
Normal rank
Property / zbMATH Keywords
 
strong equilibria
Property / zbMATH Keywords: strong equilibria / rank
 
Normal rank
Property / zbMATH Keywords
 
weakly/strictly Pareto optimal Nash equilibria
Property / zbMATH Keywords: weakly/strictly Pareto optimal Nash equilibria / rank
 
Normal rank
Property / zbMATH Keywords
 
price of anarchy
Property / zbMATH Keywords: price of anarchy / rank
 
Normal rank
Property / zbMATH Keywords
 
price of stability
Property / zbMATH Keywords: price of stability / rank
 
Normal rank
Property / zbMATH Keywords
 
extreme Nash equilibria
Property / zbMATH Keywords: extreme Nash equilibria / 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/s10878-010-9302-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998033688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and Pareto Price of Anarchy in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / 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: Q4449200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and complexity of worst-case equilibria / 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: How hard is it to find extreme Nash equilibria in network congestion games? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in congestion games / 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: Bincoloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal solutions for bin coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for class-constrained packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online class-constrained packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class constrained bin packing problem with applications to video-on-demand / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:57, 5 July 2024

scientific article
Language Label Description Also known as
English
Selfish bin coloring
scientific article

    Statements

    Selfish bin coloring (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithmic game theory
    0 references
    bin coloring
    0 references
    Nash equilibria
    0 references
    strong equilibria
    0 references
    weakly/strictly Pareto optimal Nash equilibria
    0 references
    price of anarchy
    0 references
    price of stability
    0 references
    extreme Nash equilibria
    0 references
    0 references