Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3981356
Jump to:navigation, search

zbMath0761.05009MaRDI QIDQ3981356

William A. Webb, Jack M. Robertson

Publication date: 26 June 1992


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fair divisiondivide and conquercake-cutting problem


Mathematics Subject Classification ID

Partitions of sets (05A18) Length, area, volume, other geometric measure theory (28A75) Social choice (91B14) Recreational mathematics (00A08)


Related Items (6)

How to cut a cake fairly using a minimal number of cuts ⋮ Approximating fair division with a limited number of cuts ⋮ How to obtain a range of a nonatomic vector measure in \(\mathbb R^2\) ⋮ An algorithm for super envy-free cake division ⋮ On the complexity of cake cutting ⋮ Ramsey partitions of integers and fair divisions




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3981356&oldid=12022402"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki