Timeline for Fair cake-cutting between groups
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 5, 2020 at 11:56 | history | edited | Erel Segal-Halevi | CC BY-SA 4.0 |
added 431 characters in body
|
May 18, 2015 at 9:15 | vote | accept | Erel Segal-Halevi | ||
May 15, 2015 at 6:45 | answer | added | Erel Segal-Halevi | timeline score: 1 | |
Apr 29, 2015 at 6:51 | answer | added | Erel Segal-Halevi | timeline score: 3 | |
Apr 25, 2015 at 15:29 | answer | added | Manfred Weis | timeline score: 4 | |
Apr 17, 2015 at 12:24 | history | edited | Erel Segal-Halevi | CC BY-SA 3.0 |
There are n citizens in each state.
|
Apr 17, 2015 at 4:27 | answer | added | Tony Huynh | timeline score: 5 | |
Apr 16, 2015 at 10:43 | comment | added | Pietro Majer | A remark on the existence result. Even with $k$ states and $N$ atomless probability measures, there exists a measurable $k$-partition $\{A_j\}_{1\le j\le k}$ such that $\mu_i(A_j)=1/k$ for all $1\le i\le N$ and $1\le j\le k$. It's a consequence of the Lyapounov convexity theorem. | |
Apr 16, 2015 at 9:33 | history | edited | Erel Segal-Halevi | CC BY-SA 3.0 |
added 812 characters in body
|
Apr 16, 2015 at 6:59 | history | asked | Erel Segal-Halevi | CC BY-SA 3.0 |