Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
STOC
2007
ACM
favorite
Email
discuss
report
164
views
Algorithms
»
more
STOC 2007
»
An approximation algorithm for max-min fair allocation of indivisible goods
14 years 10 months ago
Download
www.stanford.edu
Arash Asadpour, Amin Saberi
Real-time Traffic
Algorithms
|
Max-min Fair Allocation
|
STOC 2007
|
claim paper
Related Content
»
MaxMin allocation via degree lowerbounded arborescences
»
On approximately fair allocations of indivisible goods
»
On the Complexity of Efficiency and EnvyFreeness in Fair Division of Indivisible Goods wit...
»
Fair Division under Ordinal Preferences Computing EnvyFree Allocations of Indivisible Good...
»
Maximum Throughput and Fair Bandwidth Allocation in MultiChannel Wireless Mesh Networks
»
On allocations that maximize fairness
»
LP Solvable Models for Multiagent Fair Allocation Problems
»
On Allocating Goods to Maximize Fairness
»
On Maxsum Fair Cake Divisions
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2007
Where
STOC
Authors
Arash Asadpour, Amin Saberi
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision