scientific article; zbMATH DE number 1015852
From MaRDI portal
Publication:4338900
zbMATH Open0991.91019MaRDI QIDQ4338900FDOQ4338900
Authors: Steven J. Brams, Alan D. Taylor 
Publication date: 2 June 1997
Title of this publication is not available (Why is that?)
Recommendations
Decision theory (91B06) Social choice (91B14) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) (n)-person games, (n>2) (91A06) Dissections and valuations (Hilbert's third problem, etc.) (52B45)
Cited In (only showing first 100 items - show all)
- Envy-free division of discrete cakes
- Envy-free division of discrete cakes
- Price of fairness in two-agent single-machine scheduling problems
- The composite iteration algorithm for finding efficient and financially fair risk-sharing rules
- The adjusted Knaster procedure under unequal entitlements.
- About inheritance distribution.
- Fair allocation of indivisible goods: beyond additive valuations
- Handling preferences in student-project allocation
- Cooperation in dividing the cake
- A fair procedure in insurance
- Constructing a Fair Border
- How to cut a cake with a Gram matrix
- On maximin share allocations in matroids
- Self-interest and equity concerns: a behavioural allocation rule for operational problems
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- A protocol for cutting matroids like cakes
- Approximate maximin share allocations in matroids
- Nondiscrimination and monotonicity in fair division
- Dissolving a partnership securely
- A cake for Cournot
- A `divide and choose' approach to compromising
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Hardness results for consensus-halving
- Fair division with multiple pieces
- Cake-cutting with different entitlements: how many cuts are needed?
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Fair division with no information
- Existence of a simple and equitable fair division: a short proof
- Disputed lands
- An algorithm for super envy-free cake division
- Competitive equilibrium with indivisible goods and generic budgets
- The price of envy-freeness in machine scheduling
- Procedurally fair implementation under complete information
- Sharing the surplus and proportional values
- A note on the undercut procedure
- Approximate envy-free procedures
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A strategic approach to multiple estate division problems
- A survey of mass partitions
- Picking sequences and monotonicity in weighted fair division
- Finding maxmin allocations in cooperative and competitive fair division
- On envy-free cake division
- The Dubins-Spanier optimization problem in fair division theory
- Fairly allocating many goods with few queries
- Knapsack cost sharing
- On the existence of Pareto efficient and envy-free allocations
- A NOTE ON FAIR DIVISION UNDER INTERVAL UNCERTAINTY
- A multi-objective interpretation of optimal transport
- Maximin share and minimax envy in fair-division problems.
- DIVIDING BY DEMANDING: OBJECT DIVISION THROUGH MARKET PROCEDURES
- How to be fairer
- Shadow prices in territory division
- Divide and choose: an informationally robust strategic approach to bankruptcy problems
- A simple mechanism for resolving conflict
- Truthful fair division without free disposal
- Cost-efficient equitable water distribution in Algeria: a bicriteria fair division problem with network constraints
- Approximating the Nash Social Welfare with Indivisible Items
- Proportional Borda allocations
- Fair division of mixed divisible and indivisible goods
- On the complexity of cake cutting
- Cooperative models for allocating an object
- Dual auctions for assigning winners and compensating losers
- Fair assignment of indivisible objects under ordinal preferences
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- How to allocate hard candies fairly
- Proportional pie-cutting
- Quantum bargaining games
- A moving-knife solution to the four-person envy-free cake-division problem
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
- Fairness in resource allocation: foundation and applications
- Impartial division of a dollar
- Fair Division
- Fair (and not so fair) division
- How to divide things fairly
- Computation of the random arrival rule for bankruptcy problems
- Santa Claus Meets Hypergraph Matchings
- Truthful Fair Division
- The Shapley value in the Knaster gain game
- Do transitive preferences always result in indifferent divisions?
- Allocation rules for land division
- Divide-and-permute
- A fair division solution to the problem of redistricting
- Computing fair and efficient allocations with few utility values
- Children crying at birthday parties. Why?
- Maximizing the minimum voter satisfaction on spanning trees
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Implementing equal division with an ultimatum threat
- Decentralized pricing in minimum cost spanning trees
- Approximation algorithms for computing maximin share allocations
- Almost envy-freeness with general valuations
- Dissolving a partnership dynamically
- A note on envy-free cake cutting with polynomial valuations
- Searching for joint gains in multi-party negotiations.
- Constraint proposal method for computing Pareto solutions in multi-party negotiations
- When \textit{I cut, you choose} method implies intransitivity
- Voting almost maximizes social welfare despite limited communication
- A heuristic optimization of Bayesian incentive-compatible cake-cutting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338900)
