Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Selfish bin packing
Leah Epstein
, Elena Kleiman
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Selfish bin packing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bin Packing
100%
Selfish Bin Packing
100%
Strong Nash Equilibrium
100%
Subset Sum
60%
Pure Nash Equilibrium
40%
Social Cost
40%
Selfish Agents
40%
Tight Bounds
20%
Game Analysis
20%
Computer Science
20%
Tight Upper Bound
20%
Tight Lower Bound
20%
Approximation Ratio
20%
Bin Packing Problem
20%
Polynomial-time Algorithm
20%
Social Goals
20%
P-NP
20%
Small Modification
20%
Optimal Packing
20%
Mathematics
Nash Equilibrium
100%
Subset Sum
42%
Minimizes
14%
Lower and upper bounds
14%
Packing Problem
14%
Asymptotics
14%
Polynomial Time
14%
Worst Case
14%
Computer Science
Nash Equilibrium
100%
Bin Packing Problem
14%
Approximation Ratio
14%
Polynomial Time Algorithm
14%
Computer Science
14%
Economics, Econometrics and Finance
Nash Equilibrium
100%