• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

News

HSE SPb & EUSP Research Seminar on October, 17: Herve Moulin (University of Glasgow)

Topic: Guarantees in Fair Division: beyond Divide and Choose and Moving Knives
Date & Time: October, 17; 18:00 - 19:30
Venue: St Petersburg, Fontanka river embankment, 27, PDMI RAS, Marble hall (2nd floor)

We invite you to participate in the HSE in St Petersburg and European University in St Petersburg Research seminar on October, 17.

Herve Moulin (University of Glasgow) will give a talk on Guarantees in Fair Division: beyond Divide and Choose and Moving Knives. Please find the abstract below.

Slides (PDF, 89 Kb) 


Time: 18:00 - 19:30
Venue: St Petersburg, Fontanka river embankment, 27, PDMI RAS, Marble hall (2nd floor)

Abstract:
Steinhaus' Diminishing Share (DS) algorithm (generalizing Divide & Choose D&C), as well as Dubins and Spanier' Moving Knife (MK) algorithm, guarantee to all participants a Fair Share of the manna (its worth at least 1/n-th of that of the whole manna) while eliciting parsimonious information from them. However DS and MK are only defined when 1. preferences are represented by additive utilities.; and 2. every part of the manna to be divided is desirable to every participant (a cake), or every part is unpleasant to everybody (a chore). 

Our n-person Divide & Choose rule takes care of issue 2 when utilities are additive: it requires no trimming or padding, and works for mixed manna with subjective goods and bads. It also implements the canonical approximation of the Fair Share (up to one item) when we allocate indivisible items. 

Issue 1 is much deeper, it challenges us to define a Fair Share Guarantee when 1/n-th of the whole manna makes no sense. The same D&Cn rule implements such a bound, for very general preferences restricted by a continuity assumption but no monotonicity whatsoever. The minMax utility of an agent is that of his best share in the worst possible partition. It is lower than his Maxmin utility (that of his worst share in the best possible partition), that cannot be guaranteed to all agents. 

When the manna contains only goods, or only bads, the minMax Guarantee can be improved in infinitely many ways. Our Bid & Choose rules improve upon the MK rules by fixing a benchmark value of shares, and asking agents to bid the smallest size of an acceptable share. The resulting Guarantees fall between their minMax and Maxmin


Calendar: https://tinyurl.com/spbecon
Research seminar webpage: http://scem.spb.hse.ru/en/ilgt/hse-eusp-seminar