A bin packing game with cardinality constraints under the best cost rule (Q4634294)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A bin packing game with cardinality constraints under the best cost rule |
scientific article; zbMATH DE number 7051664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bin packing game with cardinality constraints under the best cost rule |
scientific article; zbMATH DE number 7051664 |
Statements
A bin packing game with cardinality constraints under the best cost rule (English)
0 references
7 May 2019
0 references
game
0 references
Nash equilibrium
0 references
price of anarchy
0 references
bin packing
0 references
0 references
0.9115387201309204
0 references
0.8944063186645508
0 references
0.8617333769798279
0 references
0.8552473783493042
0 references
0.8499208092689514
0 references
