Name
Abstract | ||
|---|---|---|
We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [0,1]2, where (0,0)∈P; Bob cuts out n axis-parallel rectangles with disjoint interiors, each of them having a point of P as the lower left corner; Alice keeps the rest. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.endm.2011.09.044 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Combinatorial Geometry,Cake Cutting,Packing Rectangles | Discrete mathematics,Combinatorics,Disjoint sets,Cake number,Omega,Mathematics | Journal |
Volume | ISSN | Citations |
38 | 1571-0653 | 2 |
PageRank | References | Authors |
0.39 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tobias Christ | 1 | 23 | 3.16 |
| Andrea Francke | 2 | 9 | 1.31 |
| Heidi Gebauer | 3 | 83 | 11.07 |
| Jirí Matousek | 4 | 763 | 76.77 |
| Takeaki Uno | 5 | 1319 | 107.99 |