The lion's share. Is fairness easy? (WIP) 26 February...
Transcript of The lion's share. Is fairness easy? (WIP) 26 February...
![Page 1: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/1.jpg)
The lion’s share. Is fairness easy? (WIP)26 February 2008
Lorenzo Cioni
Department of “Computer Science”University of Pisa
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 2: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/2.jpg)
Introduction
In this presentation we deal with fair allocations involving n ≥ 2parties (or players).
We are therefore interested in how to determine if an allocationamong n parties of divisible/indivisible goods is fair or not.
We need some fairness criteria.
Note: this talk will be in PPEnglish (Personal Pisa English, apersonal dialect of the English spoken in Pisa, no simultaneoustranslation service is available).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 3: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/3.jpg)
Introduction
In this presentation we deal with fair allocations involving n ≥ 2parties (or players).
We are therefore interested in how to determine if an allocationamong n parties of divisible/indivisible goods is fair or not.
We need some fairness criteria.
Note: this talk will be in PPEnglish (Personal Pisa English, apersonal dialect of the English spoken in Pisa, no simultaneoustranslation service is available).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 4: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/4.jpg)
Introduction
In this presentation we deal with fair allocations involving n ≥ 2parties (or players).
We are therefore interested in how to determine if an allocationamong n parties of divisible/indivisible goods is fair or not.
We need some fairness criteria.
Note: this talk will be in PPEnglish (Personal Pisa English, apersonal dialect of the English spoken in Pisa, no simultaneoustranslation service is available).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 5: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/5.jpg)
Introduction
In this presentation we deal with fair allocations involving n ≥ 2parties (or players).
We are therefore interested in how to determine if an allocationamong n parties of divisible/indivisible goods is fair or not.
We need some fairness criteria.
Note: this talk will be in PPEnglish (Personal Pisa English, apersonal dialect of the English spoken in Pisa, no simultaneoustranslation service is available).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 6: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/6.jpg)
Introduction
In this presentation we deal with fair allocations involving n ≥ 2parties (or players).
We are therefore interested in how to determine if an allocationamong n parties of divisible/indivisible goods is fair or not.
We need some fairness criteria.
Note: this talk will be in PPEnglish (Personal Pisa English, apersonal dialect of the English spoken in Pisa, no simultaneoustranslation service is available).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 7: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/7.jpg)
Introduction
In this presentation we deal with fair allocations involving n ≥ 2parties (or players).
We are therefore interested in how to determine if an allocationamong n parties of divisible/indivisible goods is fair or not.
We need some fairness criteria.
Note: this talk will be in PPEnglish (Personal Pisa English, apersonal dialect of the English spoken in Pisa, no simultaneoustranslation service is available).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 8: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/8.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 9: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/9.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 10: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/10.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 11: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/11.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 12: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/12.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 13: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/13.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 14: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/14.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 15: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/15.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 16: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/16.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 17: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/17.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 18: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/18.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 19: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/19.jpg)
Framing the problem: sharing (or allocating) is difficult
Sharing (or allocating) goods is difficult even in the simplest caseslike allocating an orange between two people (or parties).
(1) Through an arbitrator (that must perfectly know thepreferences of the parties (that must not be spiteful)):(a) half an orange each (how many ways? how many cuts?);(b) pulp (for a juice) and peel (as an ingredient for a cake);(c) as a set of segments, half (? odd cardinality ?) a set each;(d) conflicting requests?
(2) The parties themselves (maybe with the help of afacilitator/mediator):(a) as a divisible good;(b) as a set of discrete parts: peel and segments, segments only,
peel and and pulp, seeds . . .
More complex cases: allocate either a bike or a bike ad pair ofumbrellas and so on (indivisible goods).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 20: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/20.jpg)
At least i realize the bitterness of life...(a moral fable)
It seems that a lion, a fox and an ass participated in a joint hunt.On request, the ass divides the kill into three equal shares and
invites the others to choose.Enraged the lion eats the ass, then asks the fox to make the
division.The fox piles all the kill into one great heap except for one tiny
morsel.Delighted at this division, the lion asks: “Who has taught you, myvery excellent fellow, the art of division?” to which the fox replies:“I learnt it from the ass, by witnessing his fate”. (Aesop’s Fables)
The lion’s share. Peer-to-peer relations (???)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 21: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/21.jpg)
At least i realize the bitterness of life...(a moral fable)
It seems that a lion, a fox and an ass participated in a joint hunt.On request, the ass divides the kill into three equal shares and
invites the others to choose.Enraged the lion eats the ass, then asks the fox to make the
division.The fox piles all the kill into one great heap except for one tiny
morsel.Delighted at this division, the lion asks: “Who has taught you, myvery excellent fellow, the art of division?” to which the fox replies:“I learnt it from the ass, by witnessing his fate”. (Aesop’s Fables)
The lion’s share. Peer-to-peer relations (???)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 22: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/22.jpg)
At least i realize the bitterness of life...(a moral fable)
It seems that a lion, a fox and an ass participated in a joint hunt.On request, the ass divides the kill into three equal shares and
invites the others to choose.Enraged the lion eats the ass, then asks the fox to make the
division.The fox piles all the kill into one great heap except for one tiny
morsel.Delighted at this division, the lion asks: “Who has taught you, myvery excellent fellow, the art of division?” to which the fox replies:“I learnt it from the ass, by witnessing his fate”. (Aesop’s Fables)
The lion’s share. Peer-to-peer relations (???)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 23: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/23.jpg)
At least i realize the bitterness of life...(a moral fable)
It seems that a lion, a fox and an ass participated in a joint hunt.On request, the ass divides the kill into three equal shares and
invites the others to choose.Enraged the lion eats the ass, then asks the fox to make the
division.The fox piles all the kill into one great heap except for one tiny
morsel.Delighted at this division, the lion asks: “Who has taught you, myvery excellent fellow, the art of division?” to which the fox replies:“I learnt it from the ass, by witnessing his fate”. (Aesop’s Fables)
The lion’s share. Peer-to-peer relations (???)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 24: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/24.jpg)
Definition of fairness
An allocation is said to be fair to the degree it satisfies a set ofcriteria and enables each party to achieve a certain degree ofsatisfaction independently from what other parties do (r1).
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 25: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/25.jpg)
Definition of fairness
An allocation is said to be fair to the degree it satisfies a set ofcriteria and enables each party to achieve a certain degree ofsatisfaction independently from what other parties do (r1).
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 26: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/26.jpg)
Definition of fairness
An allocation is said to be fair to the degree it satisfies a set ofcriteria and enables each party to achieve a certain degree ofsatisfaction independently from what other parties do (r1).
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 27: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/27.jpg)
Definition of fairness
An allocation is said to be fair to the degree it satisfies a set ofcriteria and enables each party to achieve a certain degree ofsatisfaction independently from what other parties do (r1).
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 28: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/28.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 29: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/29.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 30: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/30.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 31: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/31.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 32: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/32.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 33: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/33.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)
If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 34: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/34.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)
If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 35: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/35.jpg)
The theoretical framework: fairness criteria
(1) envy-freeness,
(2) proportionality,
(3) equitability,
(4) efficiency.
If n = 2 ⇒ (1) ≡ (2)If n > 2 ⇒ (1) ⇒ (2)If n > 2 ⇒ (2) 6⇒ (1)
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 36: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/36.jpg)
Importance of fairness
Why is fairness so important?If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 37: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/37.jpg)
Importance of fairness
Why is fairness so important?
If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 38: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/38.jpg)
Importance of fairness
Why is fairness so important?If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 39: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/39.jpg)
Importance of fairness
Why is fairness so important?If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 40: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/40.jpg)
Importance of fairness
Why is fairness so important?If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 41: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/41.jpg)
Importance of fairness
Why is fairness so important?If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 42: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/42.jpg)
Importance of fairness
Why is fairness so important?If fairnesss is violated then at least one of the following casesholds:
(1) no envy-freeness ⇒ we can get better allocations,
(2) no proportionality ⇒ we can get better allocations,
(3) no equitability ⇒ we can get better allocations,
(4) no efficiency ⇒ we can get better allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 43: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/43.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 44: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/44.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 45: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/45.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 46: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/46.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 47: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/47.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 48: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/48.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 49: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/49.jpg)
Classical definitions 1
(1) Envy-freeness
(1.a) An allocation is envy-free (r1, r2) if every party thinks to havereceived a portion that is at least as valuable as the portionreceived by every other party.
(2) Proportionality
(2.a) An allocation is proportional (r1, r2) if every party thinks tohave received a portion that is at least worth 1
n of the totalvalue.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 50: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/50.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 51: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/51.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 52: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/52.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 53: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/53.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 54: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/54.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 55: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/55.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 56: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/56.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his own
Proportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 57: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/57.jpg)
Formalizing definitions 1
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(1) Envy-freeness
(1.a) 6 ∃i ∈ N such that Pij > Pii for some j ∈ N
(2) Proportionality
(2.a) if Pii ≥ 1n
∑j∈N Pij ∀i ∈ N
Envy-freeness can be expressed in terms of preferences: we say anallocation is envy-free if no player prefers somebody’s else portionto his ownProportionality can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 58: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/58.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 59: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/59.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 60: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/60.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 61: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/61.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 62: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/62.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 63: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/63.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 64: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/64.jpg)
Classical definitions 2
(3) Equitability
(3.a) An allocation is equitable (r1, r2) if each party believes theportion it received is the same fractional part of the total value.
(4) Efficiency
(4.a) An allocation is efficient (r1, r2) if there is no other allocationwhere some party is better off and no other party is worse off.
(r1) Steven J. Brams and Alan D. Taylor, “The Win-Win solution. Guaranteeing fairshares to everybody”, W. W. Norton & Company, 1999(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 65: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/65.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 66: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/66.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 67: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/67.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 68: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/68.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 69: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/69.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 70: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/70.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 71: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/71.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least one
Equitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 72: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/72.jpg)
Formalizing definitions 2
We denote with Pij the value the player i gives to the portionreceived by player j with i , j ∈ N (N is the set of players)
(3) Efficiency (Pareto)
(3.a) if 6 ∃ another allocation with evaluations Q such that (Qii ≥ Pii
and ∃i∗ ∈ N such that Qi∗i∗ > Pi∗i∗)
(4) Equitability
(4.a) if Pii = Pjj ∀i , j ∈ N so player i and j equally evaluate thereceived portions.
Efficiency can be expressed in terms of preferences: we say anallocation is efficient if there is no allocation that is weaklypreferred by every player and strictly preferred by at least oneEquitability can be expressed only in terms of utilities
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 73: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/73.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 74: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/74.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 75: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/75.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 76: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/76.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 77: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/77.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 78: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/78.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 79: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/79.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 80: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/80.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 81: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/81.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 82: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/82.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 83: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/83.jpg)
Aims of the presentation
In this presentation we use (r2) topresent a limited set of algorithms for the description ofallocations:
envy-free,proportional,
for either n = 2 or n > 2 players and in cases of
divisible goods,indivisible goods.
We could also relate the concept of fairness with that ofequity (r3) (but we do not do that, at least in this talk).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
(r3) H. Peyton Young, “Equity. In Theory and Practice”, Princeton University Press,
1994
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 84: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/84.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 85: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/85.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 86: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/86.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 87: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/87.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 88: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/88.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 89: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/89.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 90: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/90.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 91: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/91.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 92: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/92.jpg)
Main cases
From (r2) to we examine a selection of the following cases:
proportionality (≡ envy-freeness) for n = 2;proportionality for n > 2, divisible case;proportionality for n > 2, indivisible case;envy-freeness and equitability for n = 2;envy-freeness for n = 3 and n = 4;envy-freeness for any n.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to dispute
resolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 93: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/93.jpg)
Other cases (next presentation, unpredictable future)
We (see (r2)) fully disregard the following cases:
how to use auctions to get a fair division (for an arbitrary n);how to use elections to get a fair division (for an arbitrary n).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 94: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/94.jpg)
Other cases (next presentation, unpredictable future)
We (see (r2)) fully disregard the following cases:
how to use auctions to get a fair division (for an arbitrary n);how to use elections to get a fair division (for an arbitrary n).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 95: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/95.jpg)
Other cases (next presentation, unpredictable future)
We (see (r2)) fully disregard the following cases:
how to use auctions to get a fair division (for an arbitrary n);how to use elections to get a fair division (for an arbitrary n).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 96: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/96.jpg)
Other cases (next presentation, unpredictable future)
We (see (r2)) fully disregard the following cases:
how to use auctions to get a fair division (for an arbitrary n);how to use elections to get a fair division (for an arbitrary n).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 97: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/97.jpg)
Other cases (next presentation, unpredictable future)
We (see (r2)) fully disregard the following cases:
how to use auctions to get a fair division (for an arbitrary n);how to use elections to get a fair division (for an arbitrary n).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 98: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/98.jpg)
Other cases (next presentation, unpredictable future)
We (see (r2)) fully disregard the following cases:
how to use auctions to get a fair division (for an arbitrary n);how to use elections to get a fair division (for an arbitrary n).
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 99: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/99.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 100: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/100.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 101: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/101.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 102: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/102.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 103: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/103.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 104: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/104.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 105: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/105.jpg)
Characterization of the goods (r1)
(1) Divisible good
A good is divisible if it can be divided into parts withoutdestroying the value of its parts to the parties that get them
(2) Indivisible good
A good is indivisible if it cannot be divided without destroyingits value
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 106: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/106.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 107: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/107.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 108: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/108.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 109: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/109.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 110: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/110.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 111: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/111.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 112: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/112.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 113: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/113.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 114: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/114.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 115: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/115.jpg)
Cases of proportionality with n = 2, Bob and Carol
We have the following cases (r2):
divide and choose;filter and choose;Dubins-Spanier’s moving knife for 2 players.Austin’s moving knives for 2 players.
They work for either divisible or indivisible goods or both.
They assure envy-freeness (and proportionality) but neitherequitability nor efficiency so they are not guaranteed to be fair.
(r2) Steven J. Brams and Alan D. Taylor, “Fair division. From cake-cutting to disputeresolution”, Cambridge University Press, 1996
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 116: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/116.jpg)
Divide and choose, Bob and Carol
Divide and choose can be used both for divisiblehomogeneous/heterogeneous goods and indivisible goods (such asa list of items)We consider separately:
(1) the divisible case,
(2) the indivisible case.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 117: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/117.jpg)
Divide and choose, Bob and Carol
Divide and choose can be used both for divisiblehomogeneous/heterogeneous goods and indivisible goods (such asa list of items)
We consider separately:
(1) the divisible case,
(2) the indivisible case.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 118: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/118.jpg)
Divide and choose, Bob and Carol
Divide and choose can be used both for divisiblehomogeneous/heterogeneous goods and indivisible goods (such asa list of items)We consider separately:
(1) the divisible case,
(2) the indivisible case.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 119: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/119.jpg)
Divide and choose, Bob and Carol
Divide and choose can be used both for divisiblehomogeneous/heterogeneous goods and indivisible goods (such asa list of items)We consider separately:
(1) the divisible case,
(2) the indivisible case.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 120: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/120.jpg)
Divide and choose, Bob and Carol
Divide and choose can be used both for divisiblehomogeneous/heterogeneous goods and indivisible goods (such asa list of items)We consider separately:
(1) the divisible case,
(2) the indivisible case.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 121: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/121.jpg)
Divide and choose, Bob and Carol
Divide and choose can be used both for divisiblehomogeneous/heterogeneous goods and indivisible goods (such asa list of items)We consider separately:
(1) the divisible case,
(2) the indivisible case.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 122: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/122.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 123: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/123.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).
Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 124: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/124.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 125: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/125.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 126: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/126.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 127: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/127.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.
The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 128: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/128.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 129: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/129.jpg)
Divide and choose, divisible case
Bob and Carol must share a single divisible good (a cake, a pieceof land).Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good in two pieces between which he isindifferent and Carol chooses the one she considers the best.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 130: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/130.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 131: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/131.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.
Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 132: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/132.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 133: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/133.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 134: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/134.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.
The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 135: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/135.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 136: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/136.jpg)
Divide and choose, indivisible case
Bob and Carol must divide between themselves the items of a list,none of which is divisible and without converting the items intomoney.Possibly with a chance move (the toss of a fair coin):
(1) Bob results to be the divider,
(2) Carol results to be the chooser.
Algorithm: Bob divides the good of the list in two sublists betweenwhich he is indifferent and Carol chooses the one she considers thebest.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.Bob can use at his own advantage a knowledge of Carol’spreferences and Carol can act spitefully against Bob.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 137: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/137.jpg)
Divide and choose, general comment
In this case information plays a major role.Generally speaking:
(1) divider is disadvantaged unless he [exactly] know the chooser’spreferences,
(2) chooser can act spitefully so to damage the divider.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 138: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/138.jpg)
Divide and choose, general comment
In this case information plays a major role.
Generally speaking:
(1) divider is disadvantaged unless he [exactly] know the chooser’spreferences,
(2) chooser can act spitefully so to damage the divider.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 139: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/139.jpg)
Divide and choose, general comment
In this case information plays a major role.Generally speaking:
(1) divider is disadvantaged unless he [exactly] know the chooser’spreferences,
(2) chooser can act spitefully so to damage the divider.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 140: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/140.jpg)
Divide and choose, general comment
In this case information plays a major role.Generally speaking:
(1) divider is disadvantaged unless he [exactly] know the chooser’spreferences,
(2) chooser can act spitefully so to damage the divider.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 141: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/141.jpg)
Divide and choose, general comment
In this case information plays a major role.Generally speaking:
(1) divider is disadvantaged unless he [exactly] know the chooser’spreferences,
(2) chooser can act spitefully so to damage the divider.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 142: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/142.jpg)
Divide and choose, general comment
In this case information plays a major role.Generally speaking:
(1) divider is disadvantaged unless he [exactly] know the chooser’spreferences,
(2) chooser can act spitefully so to damage the divider.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 143: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/143.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 144: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/144.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 145: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/145.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 146: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/146.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 147: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/147.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 148: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/148.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.
The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 149: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/149.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 150: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/150.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 151: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/151.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 152: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/152.jpg)
Filter and choose, general case (a few hints)
In this case the filterer defines the two portions:
(1) one for the chooser,
(2) the remaining [implicit] portion for himself.
If the chooser accepts the division occurs, if she refuses both ofthem take nothing.The algorithms guarantees envy-freeness (proportionality) butneither equitability nor efficiency.
(1) Game Theory: all the power to the filterer (a little is betterthan nothing).
(2) Political Theory: all the power to the chooser (the power ofthe status quo).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 153: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/153.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 154: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/154.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 155: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/155.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 156: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/156.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 157: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/157.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 158: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/158.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 159: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/159.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 160: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/160.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 161: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/161.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 162: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/162.jpg)
Dubins-Spanier’s moving knife, Bob and Carol
It works for a divisible good (a rectangular cake) and if preferencesare private information of each player.It requires a referee and a knife .
(1) the referee puts the knife on the left edge and moves it in aparallel way towards the right edge,
(2) both Bob and Carol can call “cut” at any moment,
(3) the player who calls “cut” gets the portion at the left of theknife whereas the other takes the remaining portion.
(a) yes envy-freeness and proportionality;
(b) no equitability: the silent player thinks he got more;
(c) no efficiency: there may be better solutions (a horizontal cut).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 163: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/163.jpg)
Austin’s moving knives, Bob and Carol
(1) It is a variant of Dubins-Spanier’s moving knife (so it requiresa referee but two knives).
(2) It guarantees envy-freeness (and so proportionality).
(3) It guarantees equitability: each player can get, in his esteem,half of the cake.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 164: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/164.jpg)
Austin’s moving knives, Bob and Carol
(1) It is a variant of Dubins-Spanier’s moving knife (so it requiresa referee but two knives).
(2) It guarantees envy-freeness (and so proportionality).
(3) It guarantees equitability: each player can get, in his esteem,half of the cake.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 165: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/165.jpg)
Austin’s moving knives, Bob and Carol
(1) It is a variant of Dubins-Spanier’s moving knife (so it requiresa referee but two knives).
(2) It guarantees envy-freeness (and so proportionality).
(3) It guarantees equitability: each player can get, in his esteem,half of the cake.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 166: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/166.jpg)
Austin’s moving knives, Bob and Carol
(1) It is a variant of Dubins-Spanier’s moving knife (so it requiresa referee but two knives).
(2) It guarantees envy-freeness (and so proportionality).
(3) It guarantees equitability: each player can get, in his esteem,half of the cake.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 167: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/167.jpg)
Austin’s moving knives, Bob and Carol
(1) It is a variant of Dubins-Spanier’s moving knife (so it requiresa referee but two knives).
(2) It guarantees envy-freeness (and so proportionality).
(3) It guarantees equitability: each player can get, in his esteem,half of the cake.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 168: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/168.jpg)
Austin’s moving knives, Bob and Carol
(1) It is a variant of Dubins-Spanier’s moving knife (so it requiresa referee but two knives).
(2) It guarantees envy-freeness (and so proportionality).
(3) It guarantees equitability: each player can get, in his esteem,half of the cake.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 169: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/169.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 170: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/170.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 171: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/171.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 172: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/172.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 173: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/173.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 174: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/174.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 175: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/175.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 176: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/176.jpg)
Austin’s moving knives, Bob and Carol
(1) A referee moves as before a knife from the left edge to theright edge.
(2) At any time one of the two players, say Bob, can call “stop”.
(3) A second knife is put on the left edge of the cake and Bobmoves both so that when the rightmost is on the right edgethe other is where the former was at the stop.
(4) While knives are moving (but the relative distance can vary)Carol can call “stop” at any moment.
(5) Chance establishes who gets the inner portion between theknives so that the other player gets the outer portions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 177: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/177.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 178: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/178.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 179: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/179.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 180: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/180.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 181: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/181.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 182: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/182.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 183: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/183.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 184: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/184.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 185: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/185.jpg)
Proportionality n > 2, divisible case
We have the following procedures:
(1) the Steinhaus-Kuhn lone-divider procedure (one of the playersacts as a lone divider whereas the others act as eitherchoosers or following dividers/choosers);
(2) the Banach-Knaster last-diminisher procedure;(3) the Dubins-Spanier moving-knife procedure;(4) the Fink lone-chooser procedure for n = 3 and its extensions
for n ≥ 4.(5) Bob, Carol and Ted n = 3. Bob splits the cake in two for him
equal parts A and B. Carol chooses one and gives the otherto Bob. Bob and Carol trisects their own pieces. Ted choosestwo pieces, one from each triple, leaving the other two piecesto Bob and Carol respectively. Ted is the lone chooser.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 186: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/186.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 187: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/187.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 188: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/188.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 189: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/189.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 190: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/190.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 191: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/191.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 192: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/192.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 193: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/193.jpg)
Banach-Knaster last-diminisher for n > 2
It guarantees only proportionality.
(1) Players are ordered either by chance or by an arbitrator as1 . . . n.
(2) The i-th player cuts a slice of the cake and pass it on to theother players.
(3) Every following player can reduce the slice if he thinks it is toobig.
(4) The player who is the last to diminish the slice gets it andexits the game.
(5) The remaining parts of the cake are collected in a smaller cakeand if more that one player is left we go back to (2) else thelast slice is given to the last player.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 194: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/194.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 195: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/195.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 196: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/196.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 197: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/197.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 198: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/198.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 199: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/199.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 200: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/200.jpg)
Dubins-Spanier’s moving knife for n > 2
It guarantees only proportionality. It needs a referee.
(1) The referee puts the knife on the left edge of the cake andmoves it in a parallel way towards the right edge.
(2) One of the players can call “cut” at any moment.
(3) The player who calls “cut” gets the portion at the left of theknife and exits the game.
(4) If there are at least two players left we go back to (1).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 201: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/201.jpg)
Proportionality n > 2, indivisible case
We need procedures for the cases of indivisible goods whose valueis destroyed if they are divided (no partial allocations). We onlymention the following procedures:
(1) the Knaster’s procedure of sealed bids (efficient but notenvy-free) uses an auction like mechanism to allocate goodsand distribute money compensations from players who getsmore to players who gets less;
(2) the Luca’s method of markers (neither efficient nor envy-free)that uses an ordering of the goods and markers from theplayers to define n segments of goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 202: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/202.jpg)
Proportionality n > 2, indivisible case
We need procedures for the cases of indivisible goods whose valueis destroyed if they are divided (no partial allocations). We onlymention the following procedures:
(1) the Knaster’s procedure of sealed bids (efficient but notenvy-free) uses an auction like mechanism to allocate goodsand distribute money compensations from players who getsmore to players who gets less;
(2) the Luca’s method of markers (neither efficient nor envy-free)that uses an ordering of the goods and markers from theplayers to define n segments of goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 203: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/203.jpg)
Proportionality n > 2, indivisible case
We need procedures for the cases of indivisible goods whose valueis destroyed if they are divided (no partial allocations). We onlymention the following procedures:
(1) the Knaster’s procedure of sealed bids (efficient but notenvy-free) uses an auction like mechanism to allocate goodsand distribute money compensations from players who getsmore to players who gets less;
(2) the Luca’s method of markers (neither efficient nor envy-free)that uses an ordering of the goods and markers from theplayers to define n segments of goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 204: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/204.jpg)
Proportionality n > 2, indivisible case
We need procedures for the cases of indivisible goods whose valueis destroyed if they are divided (no partial allocations). We onlymention the following procedures:
(1) the Knaster’s procedure of sealed bids (efficient but notenvy-free) uses an auction like mechanism to allocate goodsand distribute money compensations from players who getsmore to players who gets less;
(2) the Luca’s method of markers (neither efficient nor envy-free)that uses an ordering of the goods and markers from theplayers to define n segments of goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 205: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/205.jpg)
Proportionality n > 2, indivisible case
We need procedures for the cases of indivisible goods whose valueis destroyed if they are divided (no partial allocations). We onlymention the following procedures:
(1) the Knaster’s procedure of sealed bids (efficient but notenvy-free) uses an auction like mechanism to allocate goodsand distribute money compensations from players who getsmore to players who gets less;
(2) the Luca’s method of markers (neither efficient nor envy-free)that uses an ordering of the goods and markers from theplayers to define n segments of goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 206: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/206.jpg)
Proportionality n > 2, indivisible case
We need procedures for the cases of indivisible goods whose valueis destroyed if they are divided (no partial allocations). We onlymention the following procedures:
(1) the Knaster’s procedure of sealed bids (efficient but notenvy-free) uses an auction like mechanism to allocate goodsand distribute money compensations from players who getsmore to players who gets less;
(2) the Luca’s method of markers (neither efficient nor envy-free)that uses an ordering of the goods and markers from theplayers to define n segments of goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 207: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/207.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 208: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/208.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 209: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/209.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 210: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/210.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 211: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/211.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 212: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/212.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 213: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/213.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 214: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/214.jpg)
Envy-freeness and equitability for n = 2
We have the following procedures:
(1) the Adjusted-Winner procedure (strategic behaviour);
(2) the Proportional-Allocation procedure (less manipulable, lessefficient);
(3) the Combined procedure (a sort of “fusion” between AW andPA);
(4) more than 2 players: there may be no way to assign points toplayers that is efficient, equitable and envy-free (so onlyproportionality is saved).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 215: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/215.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 216: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/216.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 217: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/217.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 218: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/218.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 219: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/219.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 220: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/220.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 221: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/221.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 222: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/222.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 223: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/223.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 224: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/224.jpg)
Adjusted Winner (AW) for n = 2
It allows a division of the goods from a common list of m goodsb1, . . . , bm between two players. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) efficient.
AW is based on the assignment from both players of a non nullportion of 100 points (common scale) and is made of twoconsecutive phases:
(1) win, where the single players gets the goods on which theywin by putting more points than the other;
(2) adjust, where goods are transferred from one player to theother so that both can get the same amount of points;
(2) only the good on which equitability adjustment is made needto be divisible.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 225: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/225.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 226: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/226.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 227: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/227.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 228: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/228.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 229: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/229.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 230: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/230.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 231: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/231.jpg)
Adjusted Winner (AW) for n = 2
Each player puts some points on each bi .
(1) Each player gets the goods he values strictly more than theother.
(2) If the goods are over and if both players get the same sum ofpoints we are over otherwise we can try to obtain a parityfirstly assigning (one after the other) to the lower score playerthe goods on which they put the same amount of points.
(3) If in this way we get a parity we are over otherwise we musttransfer a good (or better a portion of it) from the higherscore player (be it 1) to the lower score one (be it 2).
(4) To find such a good we evaluate for each good of 1 the ratioof 1’s points to 2’s points for that good. We then choose thegood with the lowest ratio and split it as α and 1− α so toattain parity.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 232: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/232.jpg)
Adjusted Winner, an example
I II
A 35 55B 6 1C 8 1D 8 1E 5 6F 18 17G 15 15H 5 4
Total 100 100
(1) I wins B, C , D, F and H for a total of 45 points whereas IIwins A and E for a total of 61 points.
(2) We have a draw on G and we assign it to I to get respectively60 and 61 points.
(3) We can obtain perfect parity by transferring 111 of E from II to
I (we suppose E is perfectly divisible).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 233: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/233.jpg)
Adjusted Winner, an example
I II
A 35 55B 6 1C 8 1D 8 1E 5 6F 18 17G 15 15H 5 4
Total 100 100
(1) I wins B, C , D, F and H for a total of 45 points whereas IIwins A and E for a total of 61 points.
(2) We have a draw on G and we assign it to I to get respectively60 and 61 points.
(3) We can obtain perfect parity by transferring 111 of E from II to
I (we suppose E is perfectly divisible).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 234: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/234.jpg)
Adjusted Winner, an example
I II
A 35 55B 6 1C 8 1D 8 1E 5 6F 18 17G 15 15H 5 4
Total 100 100
(1) I wins B, C , D, F and H for a total of 45 points whereas IIwins A and E for a total of 61 points.
(2) We have a draw on G and we assign it to I to get respectively60 and 61 points.
(3) We can obtain perfect parity by transferring 111 of E from II to
I (we suppose E is perfectly divisible).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 235: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/235.jpg)
Adjusted Winner, an example
I II
A 35 55B 6 1C 8 1D 8 1E 5 6F 18 17G 15 15H 5 4
Total 100 100
(1) I wins B, C , D, F and H for a total of 45 points whereas IIwins A and E for a total of 61 points.
(2) We have a draw on G and we assign it to I to get respectively60 and 61 points.
(3) We can obtain perfect parity by transferring 111 of E from II to
I (we suppose E is perfectly divisible).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 236: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/236.jpg)
Adjusted Winner, an example
I II
A 35 55B 6 1C 8 1D 8 1E 5 6F 18 17G 15 15H 5 4
Total 100 100
(1) I wins B, C , D, F and H for a total of 45 points whereas IIwins A and E for a total of 61 points.
(2) We have a draw on G and we assign it to I to get respectively60 and 61 points.
(3) We can obtain perfect parity by transferring 111 of E from II to
I (we suppose E is perfectly divisible).
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 237: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/237.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 238: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/238.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 239: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/239.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 240: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/240.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 241: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/241.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 242: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/242.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 243: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/243.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 244: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/244.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 245: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/245.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 246: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/246.jpg)
Proportional Allocation (PA) for n = 2
It is a variation of AW. The procedure is:
(1) envy-free so is
(2) proportional;
(3) equitable;
(4) not efficient since the players can exchange fractions of goodsso to be both better off.
(1) PA is based on the assignment from both players of a non nullportion of 100 points (common scale);
(2) given bk , if 1 assigns xk and 2 assigns yk points . . .
(3) 1 gets a fraction xkxk+yk
and 2 gets a fraction ykxk+yk
. Fraction:time/value/portion.
(4) If we have bs and bt such that xsxt< ys
ytit is possible to
exchange a fraction α of bs with a fraction β of bt so thatboth players are better off.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 247: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/247.jpg)
Proportional Allocation, an example
A B C D
I 10 20 70 0II 30 40 0 30
A B C D Total points
I 14 2.5 1
3 6.66 1 70 0 0 79.16II 3
4 22.5 23 26.66 0 0 1 30 79.16
A B C D Total points
I 0 0 12 10 1 70 0 0 80
II 1 30 12 20 0 0 1 30 80
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 248: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/248.jpg)
Proportional Allocation, an example
A B C D
I 10 20 70 0II 30 40 0 30
A B C D Total points
I 14 2.5 1
3 6.66 1 70 0 0 79.16II 3
4 22.5 23 26.66 0 0 1 30 79.16
A B C D Total points
I 0 0 12 10 1 70 0 0 80
II 1 30 12 20 0 0 1 30 80
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 249: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/249.jpg)
Proportional Allocation, an example
A B C D
I 10 20 70 0II 30 40 0 30
A B C D Total points
I 14 2.5 1
3 6.66 1 70 0 0 79.16II 3
4 22.5 23 26.66 0 0 1 30 79.16
A B C D Total points
I 0 0 12 10 1 70 0 0 80
II 1 30 12 20 0 0 1 30 80
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 250: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/250.jpg)
Proportional Allocation, an example
A B C D
I 10 20 70 0II 30 40 0 30
A B C D Total points
I 14 2.5 1
3 6.66 1 70 0 0 79.16II 3
4 22.5 23 26.66 0 0 1 30 79.16
A B C D Total points
I 0 0 12 10 1 70 0 0 80
II 1 30 12 20 0 0 1 30 80
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 251: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/251.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 252: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/252.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 253: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/253.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 254: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/254.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 255: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/255.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 256: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/256.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 257: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/257.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 258: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/258.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 259: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/259.jpg)
Adjusted Winner, the same example (tricky, 0 divisor)
A B C D
I 10 20 70 0II 30 40 0 30
(1) I wins C ;
(2) II wins A, B and D;
(3) we evaluate the ratios 3010 and 40
20 and take the lowest;
(4) we solve 30 + 30 + α40 = 70 + (1− α)20 to get α = 12 ;
(5) both I and II get 80 points;
(6) in this case all the goods are divisible, in any case at least onemust be divisible.
(7) Divide the indivisible: convert into money, probability,time-sharing.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 260: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/260.jpg)
Example of point assignment for n = 3
G1 G2 G3 Total
A 40 50 10 100B 30 40 30 100C 30 30 40 100
(1) (A,B,C)=(G1,G2,G3): efficiency and equitability but notenvy-freeness (A envies B),
(2) (A,B,C)=(G2,G1,G3): efficiency but neither equitability norenvy-freeness (B envies A),
(3) all the items to one player: efficiency but surely neitherenvy-freeness nor equitability.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 261: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/261.jpg)
Example of point assignment for n = 3
G1 G2 G3 Total
A 40 50 10 100B 30 40 30 100C 30 30 40 100
(1) (A,B,C)=(G1,G2,G3): efficiency and equitability but notenvy-freeness (A envies B),
(2) (A,B,C)=(G2,G1,G3): efficiency but neither equitability norenvy-freeness (B envies A),
(3) all the items to one player: efficiency but surely neitherenvy-freeness nor equitability.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 262: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/262.jpg)
Example of point assignment for n = 3
G1 G2 G3 Total
A 40 50 10 100B 30 40 30 100C 30 30 40 100
(1) (A,B,C)=(G1,G2,G3): efficiency and equitability but notenvy-freeness (A envies B),
(2) (A,B,C)=(G2,G1,G3): efficiency but neither equitability norenvy-freeness (B envies A),
(3) all the items to one player: efficiency but surely neitherenvy-freeness nor equitability.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 263: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/263.jpg)
Example of point assignment for n = 3
G1 G2 G3 Total
A 40 50 10 100B 30 40 30 100C 30 30 40 100
(1) (A,B,C)=(G1,G2,G3): efficiency and equitability but notenvy-freeness (A envies B),
(2) (A,B,C)=(G2,G1,G3): efficiency but neither equitability norenvy-freeness (B envies A),
(3) all the items to one player: efficiency but surely neitherenvy-freeness nor equitability.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 264: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/264.jpg)
Example of point assignment for n = 3
G1 G2 G3 Total
A 40 50 10 100B 30 40 30 100C 30 30 40 100
(1) (A,B,C)=(G1,G2,G3): efficiency and equitability but notenvy-freeness (A envies B),
(2) (A,B,C)=(G2,G1,G3): efficiency but neither equitability norenvy-freeness (B envies A),
(3) all the items to one player: efficiency but surely neitherenvy-freeness nor equitability.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 265: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/265.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 266: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/266.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 267: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/267.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).
We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 268: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/268.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 269: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/269.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 270: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/270.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 271: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/271.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 272: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/272.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 273: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/273.jpg)
Envy-free procedures for n = 3 and n = 4
The players aim at envy-free allocations (⇒ proportional).We only mention the following procedures that can be used todivide constructively (specifying an algorithm) an heterogeneousgood:
(1) the Selfridge-Conway procedure for n = 3;
(2) the Stromquist moving-knife procedure for n = 3;
(3) the Levmore-Cook moving-knife procedure for n = 3;
(3) the Webb moving-knife procedure for n = 3;
(4) other procedures for n = 3 or n = 4.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 274: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/274.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 275: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/275.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 276: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/276.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 277: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/277.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 278: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/278.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 279: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/279.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 280: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/280.jpg)
Envy-free procedures for any n
We only mention the following families of procedures:
(1) approximate procedures;
(2) infinite procedures;
(3) finite procedures;
(3) the use of trimming procedures to indivisible goods.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 281: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/281.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 282: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/282.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 283: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/283.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).
Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 284: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/284.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.
Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 285: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/285.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.
Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 286: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/286.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.
Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 287: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/287.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 288: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/288.jpg)
Equity, what it is concerned with
Equity is concerned (r3) “with the proper distribution of resource,rights, duties, opportunities, and obligations in society at large”(theoretical view).Equity in concrete situations where it may be confronted withfairness.Equity is at the centre of distributive problems.Equity is shaped (r3) by cultural values, precedent and by thespecific types of goods and burdens to be distributed.Equity has to do (r3) with fair allocations.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 289: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/289.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 290: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/290.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .
Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 291: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/291.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 292: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/292.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 293: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/293.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 294: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/294.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 295: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/295.jpg)
Equity and fairness
Equity is “fairness” + claims + culture .Example: equitable allocation of a piece of land under conflictinglegitimate claims. A claims the whole land, B claims the east halfof the land. Possible solutions.
(1) Proportionality: A gets 23 of the land B gets 1
3 of the land(possibly on the east side).
(2) Uncontested portion: A gets 12 + 1
4 = 34 of the land (the
uncontested portion and half of the other one) B gets 14 of
the land (half of the contested portion, on the east side).
(3) Modified uncontested portion: A gets 12 + 2
3 ∗12 = 5
6 of theland (the uncontested portion and two/third of the other one)B gets 1
3 ∗12 = 1
6 of the land (on the east side).
(3) Other solutions?
Legitimate claim: is a claim that is well grounded and sound undergiven habits and conventions.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 296: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/296.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 297: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/297.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 298: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/298.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 299: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/299.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 300: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/300.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 301: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/301.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 302: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/302.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 303: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/303.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 304: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/304.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.
Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 305: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/305.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 306: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/306.jpg)
Untouched issues
Things we completely disregarded include (but are not limited to):
(1) simple or balanced alternation procedures,
(2) sophisticated (or strategic) procedures,
(3) arbitration procedures,
(4) allocations with entitlements and or of chores,
(5) mixed allocations (goods and chores, divisible and indivisiblebut with the exceptions of AW and PA).
Entitlement: the minimal portion of a good or goods that an actormust receive under a fair-division procedure.Chores: the opposite of goods, also called bads.
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 307: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/307.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 308: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/308.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 309: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/309.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 310: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/310.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 311: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/311.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 312: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/312.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 313: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/313.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008
![Page 314: The lion's share. Is fairness easy? (WIP) 26 February 2008groups.di.unipi.it/~lcioni/papers/2008/Beamer_Seminario... · 2008. 2. 26. · The lion’s share. Is fairness easy?(WIP)](https://reader035.fdocuments.us/reader035/viewer/2022081410/609f376569524c6aac767ce7/html5/thumbnails/314.jpg)
Conclusions
(1) Fairness is a hard task even for n = 2 (do you remember theorange affair?):
(a) only proportionality is easy;(b) equitability and efficiency are hard to get;(c) envy-freeness is tricky.
(2) Advanced ad left-out topics in the next talk, coming soon.
That’s all, folks!!! Thank u...
Lorenzo Cioni The lion’s share. Is fairness easy? (WIP) 26 February 2008