scientific article; zbMATH DE number 1234106

Publication date: 28 December 1998

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

game theory division cake cutting algorithms shares fairness

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Game theory (91Axx)

Related Items (85)

Cutting a Cake Fairly for Groups Revisited ⋮ Fair and square: cake-cutting in two dimensions ⋮ Cutting a cake for infinitely many guests ⋮ Approximating the Nash Social Welfare with Indivisible Items ⋮ Envy-free allocations respecting social networks ⋮ Truthful fair division without free disposal ⋮ How to cut a cake with a Gram matrix ⋮ Approximation Algorithms for Computing Maximin Share Allocations ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ Majority additive-ordered weighting averaging: A new neat ordered weighting averaging operator based on the majority process ⋮ Dissolving a partnership dynamically ⋮ A heuristic optimization of Bayesian incentive-compatible cake-cutting ⋮ Distributed fair allocation of indivisible goods ⋮ Fair multi-cake cutting ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Children crying at birthday parties. Why? ⋮ Dissolving a partnership securely ⋮ Fairness and efficiency in cake-cutting with single-peaked preferences ⋮ On the computability of equitable divisions ⋮ Analysis of OWA operators in decision making for modelling the majority concept ⋮ When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores ⋮ Fair cake-cutting in practice ⋮ Sequential analogues of the Lyapunov and Krein-Milman theorems in Fréchet spaces ⋮ Fair cake-cutting for imitative agents ⋮ On guarantees, vetoes, and random dictators ⋮ The fair division of hereditary set systems ⋮ Thou shalt covet the average of thy neighbors' cakes ⋮ Strategy-proof and envy-free mechanisms for house allocation ⋮ Fair division with multiple pieces ⋮ On fair division with binary valuations respecting social networks ⋮ Maximin share and minimax envy in fair-division problems. ⋮ Keep your distance: land division with separation ⋮ The language of social software ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Sharing Rewards Among Strangers Based on Peer Evaluations ⋮ Unnamed Item ⋮ Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination ⋮ Extremal Characteristics of Statistical Criteria with Given Total Variation Distances between Hypotheses ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods ⋮ A note on envy-free cake cutting with polynomial valuations ⋮ Two-person cake cutting: the optimal number of cuts ⋮ How to Cut a Cake Fairly: A Generalization to Groups ⋮ On fair division of a homogeneous good ⋮ Cutting polygons into small pieces with chords: Laser-based localization ⋮ Fair Division ⋮ Dividing connected chores fairly ⋮ Fair division of mixed divisible and indivisible goods ⋮ On the complexity of cake cutting ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts ⋮ Strategic divide and choose ⋮ Fair (and not so fair) division ⋮ The efficiency of fair division ⋮ Proportional pie-cutting ⋮ Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond ⋮ The Dubins-Spanier optimization problem in fair division theory ⋮ Unnamed Item ⋮ Two-player envy-free multi-cake division ⋮ Unnamed Item ⋮ Envy-free division of discrete cakes ⋮ Extremal problems for hypotheses testing with set-valued decisions ⋮ A majority model in group decision making using QMA-OWA operators ⋮ Fair cake-cutting among families ⋮ Consensus-halving via theorems of Borsuk-Ulam and Tucker ⋮ Envy-Free Division of Land ⋮ Envy-free division of discrete cakes ⋮ Disputed lands ⋮ The return function: a new computable perspective on Bayesian-Nash equilibria ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ Fair and efficient cake division with connected pieces ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Almost envy-free allocations with connected bundles ⋮ Cake-cutting with different entitlements: how many cuts are needed? ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ A paradoxical Pareto frontier in the cake-cutting context ⋮ Mind the gap: cake cutting with separation ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ Obvious manipulations in cake-cutting ⋮ Fair Cake Division Under Monotone Likelihood Ratios ⋮ An equilibrium analysis of Knaster's fair division procedure ⋮ Nash Social Welfare Approximation for Strategic Agents

This page was built for publication: