A combinatorial algorithm to establish a fair border

DOI10.1016/S0195-6698(13)80129-1MaRDI QIDQ915733zbMATH OpenOpenAlexFDO

Authors William A. Webb

Publication date 1990

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0195-6698(13)80129-1

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorial aspects of tessellation and tiling problems (05B45)

Recommendations

• Algorithms for fair partitioning of convex polygons
• Algorithms for fair partitioning of convex polygons
• Fair Partitioning by Straight Lines
• Determining a Fair Border
• Fair partitions of polygons: an elementary introduction
• Combinatorial algorithm for restricted max-min fair allocation
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• A general branch-and-bound algorithm for fair division problems
• A geometric approach to fair division
• An algorithm for identifying fair and optimal allocations

Cites work

• A note on the cake-division problem
• Constructing a Fair Border
• Determining a Fair Border
• Dividing a cake fairly
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• Sur la division pragmatique

Cited in

(4)

• Fair and square: cake-cutting in two dimensions
• Constructing a Fair Border
• Envy-Free Division of Land
• How to cut a cake fairly using a minimal number of cuts

This page was built for publication: A combinatorial algorithm to establish a fair border

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915733)