Finding maxmin allocations in cooperative and competitive fair division

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 3 figures. There was a mistake in Proposition 3.4 of the first version. This new version corrects the mistake, adds

Scientific paper

We consider upper and lower bounds for maxmin allocations of a completely
divisible good in both competitive and cooperative strategic contexts. We then
derive a subgradient algorithm to compute the exact value up to any fixed
degree of precision.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Finding maxmin allocations in cooperative and competitive fair division does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding maxmin allocations in cooperative and competitive fair division, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding maxmin allocations in cooperative and competitive fair division will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-597335

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.