The Sponge Cake Dilemma over the Nile: Achieving Fairness in Resource Allocation with Cake Cutting Algorithms

Dwayne Woods

Home/Archive/arXiv

arXiv · 2310.11472

The Sponge Cake Dilemma over the Nile: Achieving Fairness in Resource Allocation with Cake Cutting Algorithms

Dwayne Woods

View original source ↗Read source document ↗Export metadata ↓

Abstract

This article explores the intricate dynamics of the Nile Basin dispute, a complex conflict involving Egypt, Ethiopia, and Sudan. Our central argument is that we can gain unique insights into this dispute by employing the principles of game theory and the Steinhaus cake-cutting problem - a mathematical model of fair division. These theoretical frameworks offer a novel perspective to understand the motivations and potential actions of the involved nations. More importantly, these concepts can illuminate potential pathways toward a resolution that ensures equitable resource allocation and maintains regional stability. We will analyze the conflict and explore potential solutions to this enduring dispute through this lens.

Explore related subjects

econ.GN q-fin.EC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Dwayne Woods. 2024-05-30. The Sponge Cake Dilemma over the Nile: Achieving Fairness in Resource Allocation with Cake Cutting Algorithms. https://arxiv.org/abs/2310.11472

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Computing Endogenous Transformations in Processing Networks: A Dynamic Calibration Approach

Understanding how supply chains endogenously transform requires a parametric model of processing networks with non-neutral substitution elasticities. While the Cascaded CES production function provides a rigorous framework, dynamically calibrating its structural parameters from time-series data constitutes a highly non-convex inverse optimization problem. Since enforcing strict microeconomic concavity renders standard monolithic approaches computationally intractable, we propose a novel structure-exploiting algorithm to bypass this limitation. By leveraging the physical upstreamness topology of the network, our hybrid heuristic effectively breaks the curse of dimensionality inherent in economywide processing networks. Applying this framework to U.S. time-series data, we provide a scalable computational engine to fully endogenize complex supply-chain transformations, ultimately uncovering the elastic origins of asymmetric macroeconomic tail risks.

econ.GN↗

arXiv2026

Access to Live AI Advice and Behavior Under Risk: An Incentivized Experiment

Generative AI has become an everyday advisor, and the systems people consult are live and interactive, not pre-scripted. We ask whether access to such a system changes behavior under risk. In an incentivized experiment (N = 158), participants made lottery choices with an optional decision aid presented as a conventional pre-written tool, a live one-shot AI, or a live interactive AI they could query, with information format held equivalent across conditions. Risk preferences are elicited via DOSE. We find no evidence that access to a live AI advisor changes risk aversion.

econ.GN↗

arXiv2026

Screening Out the Needy: The Effects of SNAP Work Requirements

We examine the effectiveness of work requirements as a screening device in the Supplemental Nutrition Assistance Program (SNAP). Work requirements for "able-bodied adults without dependents" were suspended after the Great Recession and gradually reinstated across counties and states in the 2010s. Using linked administrative SNAP and employment data from five states and a triple-differences design, we find that work requirements reduce SNAP participation by seven percent without increasing labor supply and disproportionately screen out low-income individuals. We develop a welfare framework to interpret these results and find that the social costs of work requirements exceed budget savings.

econ.GN↗