How to cut a cake almost fairly
| Autor: | Krumke, S.O., Lipmann, M., de Paepe, W.E., Poensgen, D., Rambau, J., Stougie, L., Woeginger, G.J. |
|---|---|
| Přispěvatelé: | Discrete Mathematics and Mathematical Programming, Stochastic Operations Research, Operations Planning Acc. & Control, Mathematics and Computer Science, Combinatorial Optimization 1, Econometrics and Operations Research |
| Jazyk: | angličtina |
| Rok vydání: | 2002 |
| Předmět: | |
| Zdroj: | Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002), 263-264 STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'2002) Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002), 263-264 STARTPAGE=263;ENDPAGE=264;TITLE=Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002) Krumke, S O, Lipmann, M, de Paepe, W E, Poensgen, D, Rambau, J, Stougie, L & Woeginger, G J 2002, How to cut a cake almost fairly . in Proceedings 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02, San Francisco CA, USA, January 6-8, 2002) . Society for Industrial and Applied Mathematics, Philadelphia, USA, pp. 263-264, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 1/01/02 . < http://portal.acm.org/citation.cfm?id=545415 > |
| Popis: | In the cake cutting problem, n = 2 players want to cut a cake into n pieces so that every player gets a "fair" share of the cake by his own measure. We describe a protocol with n - 1 cuts in which each player can enforce to get a share of at least 1/(2n - 2) of the cake. Moreover we show that no protocol with n - 1 cuts can guarantee a better fraction. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|