scientific article; zbMATH DE number 1015852

Publication date: 2 June 1997

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

fair division cake-cutting envy-free allocation fair division by auctions fair divisions by elections

Decision theory (91B06) (n)-person games, (n>2) (91A06) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Dissections and valuations (Hilbert's third problem, etc.) (52B45) Social choice (91B14) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01)

Related Items (only showing first 100 items - show all)

Cutting a Cake Fairly for Groups Revisited ⋮ Approximating the Nash Social Welfare with Indivisible Items ⋮ Approximate Maximin Share Allocations in Matroids ⋮ Truthful Fair Division ⋮ Consensus-Halving: Does It Ever Get Easier? ⋮ Approximation Algorithms for Computing Maximin Share Allocations ⋮ Fair distributions for more participants than allocations ⋮ Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting ⋮ A survey of mass partitions ⋮ Don't let the lawyers do the math: Some problems of legislative districting in the UK and the USA ⋮ Three Persons, Two Cuts: A New Cake-Cutting Algorithm ⋮ Fair multi-cake cutting ⋮ The composite iteration algorithm for finding efficient and financially fair risk-sharing rules ⋮ A Protocol for Cutting Matroids Like Cakes ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Fair allocation of indivisible goods: beyond additive valuations ⋮ When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores ⋮ Computing fair and efficient allocations with few utility values ⋮ Efficient Fair Division with Minimal Sharing ⋮ Fair cake-cutting in practice ⋮ On maximum weighted Nash welfare for binary valuations ⋮ Fair cake-cutting for imitative agents ⋮ Dual auctions for assigning winners and compensating losers ⋮ Conflict resolution in the era of cognitive multicriteria decision‐making: an AHP‐retributive approach ⋮ Multi resource allocation with partial preferences ⋮ Almost Envy-Freeness with General Valuations ⋮ On fair division with binary valuations respecting social networks ⋮ Fairness in temporal slot assignment ⋮ Fair division of goods in the shadow of market values ⋮ A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ Divide and choose: an informationally robust strategic approach to bankruptcy problems ⋮ Approximate and strategyproof maximin share allocation of chores with ordinal preferences ⋮ Computational complexity of necessary envy-freeness ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Bidding Strategies for Fantasy-Sports Auctions ⋮ Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Envy-free matchings in bipartite graphs and their applications to fair division ⋮ Countering negotiation power asymmetries by using the adjusted winner algorithm ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Sharing Rewards Among Strangers Based on Peer Evaluations ⋮ Unnamed Item ⋮ Comparing algorithms for fair allocation of indivisible items with limited information ⋮ Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness ⋮ A moving-knife solution to the four-person envy-free cake-division problem ⋮ A `divide and choose' approach to compromising ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ When Do Envy-Free Allocations Exist? ⋮ The undercut procedure: an algorithm for the envy-free division of indivisible items ⋮ Computation of the random arrival rule for bankruptcy problems ⋮ Santa Claus Meets Hypergraph Matchings ⋮ Fairness in Resource Allocation: Foundation and Applications ⋮ How to Cut a Cake Fairly: A Generalization to Groups ⋮ Fair Division ⋮ How to allocate hard candies fairly ⋮ On the complexity of cake cutting ⋮ Some comments on history based structures ⋮ Fair (and not so fair) division ⋮ Proportional pie-cutting ⋮ Searching for joint gains in multi-party negotiations. ⋮ The Dubins-Spanier optimization problem in fair division theory ⋮ Fair division of indivisible items among people with similar preferences ⋮ A cake for Cournot ⋮ Constraint proposal method for computing Pareto solutions in multi-party negotiations ⋮ Unnamed Item ⋮ Envy-free division of discrete cakes ⋮ LINEAR VERSUS NONLINEAR ALLOCATION RULES IN RISK SHARING UNDER FINANCIAL FAIRNESS ⋮ Computing fair and efficient allocations with few utility values ⋮ Envy-Free Division of Land ⋮ Envy-free division of discrete cakes ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ Inequality and Network Formation Games ⋮ Closing Gaps in Asymptotic Fair Division ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Fully Polynomial-Time Approximation Schemes for Fair Rent Division ⋮ A paradoxical Pareto frontier in the cake-cutting context ⋮ The Price of Connectivity in Fair Division ⋮ Cost-efficient equitable water distribution in Algeria: a bicriteria fair division problem with network constraints ⋮ Fair Cake Division Under Monotone Likelihood Ratios ⋮ Consensus Halving for Sets of Items ⋮ Fair in the Eyes of Others ⋮ Nash Social Welfare Approximation for Strategic Agents ⋮ Shadow prices in territory division ⋮ Fair and square: cake-cutting in two dimensions ⋮ Cutting a cake for infinitely many guests ⋮ Envy-free allocations respecting social networks ⋮ Truthful fair division without free disposal ⋮ How to cut a cake with a Gram matrix ⋮ On maximin share allocations in matroids ⋮ Do transitive preferences always result in indifferent divisions? ⋮ Auctions with bidder-determined allowable combinations ⋮ On envy-free cake division ⋮ Sequential bargaining with common values ⋮ Cooperation in dividing the cake ⋮ Divide-and-permute ⋮ Old and new moving-knife schemes ⋮ Dissolving a partnership dynamically ⋮ Sharing the surplus and proportional values ⋮ A heuristic optimization of Bayesian incentive-compatible cake-cutting

This page was built for publication: