{'fraction_non_alphanumeric': 0.018315018315018316, 'fraction_numerical': 0.0, 'mean_word_length': 5.072222222222222, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Procedure for the Allocation of Two-Dimensional Resources in a Multiagent System

This paper presents a constructive solution to the classic problem of land division. It is the first solution that enables the allocation of higher-dimensional resources without degenerating them first into a series of one-dimensional resource allocation problems. We base our allocation procedure on the topology of overlaps among the regions of interest of different agents. Our result is an algorithm suitable for computer implementation, unlike earlier ones that were only existential in nature. It uses the notion of degree of partial overlap to create a sufficiency condition for the existence of a solution, and proposes a procedure to find the overlaps in such a case. The proposed solution is fair, strategy-proof, non-existential, and does not explicitly need the resource to be measurable. The agents do not have to reveal their private utility functions. We extend our earlier result for one-dimensional resource allocation to this two-dimensional one and explain the distinctive issues involved.