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
22
click to vote
SIGECOM
2004
ACM
favorite
Email
discuss
report
100
views
ECommerce
»
more
SIGECOM 2004
»
On approximately fair allocations of indivisible goods
14 years 2 months ago
Download
www.stanford.edu
Richard J. Lipton, Evangelos Markakis, Elchanan Mo
Real-time Traffic
SIGECOM 2004
|
claim paper
Related Content
»
An approximation algorithm for maxmin fair allocation 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...
»
Efficiency and Envyfreeness in Fair Division of Indivisible Goods Logical Representation a...
»
Allocation of indivisible goods a general model and some complexity results
»
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
30 Jun 2010
Updated
30 Jun 2010
Type
Conference
Year
2004
Where
SIGECOM
Authors
Richard J. Lipton, Evangelos Markakis, Elchanan Mossel, Amin Saberi
Comments
(0)
Researcher Info
ECommerce Study Group
Computer Vision