scientific article; zbMATH DE number 1015852
From MaRDI portal
Publication:4338900
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Shadow prices in territory division
- A simple mechanism for resolving conflict
- Truthful fair division without free disposal
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Computational complexity of necessary envy-freeness
- Divide and choose: an informationally robust strategic approach to bankruptcy problems
- Cost-efficient equitable water distribution in Algeria: a bicriteria fair division problem with network constraints
- Fair cake-cutting among families
- Proportional Borda allocations
- Price of fairness in two-agent single-machine scheduling problems
- Envy-free division of discrete cakes
- Envy-free division of discrete cakes
- Approximating the Nash Social Welfare with Indivisible Items
- The composite iteration algorithm for finding efficient and financially fair risk-sharing rules
- Obvious manipulations in cake-cutting
- Fair division of mixed divisible and indivisible goods
- The adjusted Knaster procedure under unequal entitlements.
- About inheritance distribution.
- On the complexity of cake cutting
- A paradoxical Pareto frontier in the cake-cutting context
- Fair division and redistricting
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair assignment of indivisible objects under ordinal preferences
- Cooperative models for allocating an object
- Fair allocation of indivisible goods: beyond additive valuations
- Handling preferences in student-project allocation
- When do envy-free allocations exist?
- Fair multi-cake cutting
- Dual auctions for assigning winners and compensating losers
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- Cake cutting: explicit examples for impossibility results
- How to share a cake with a secret agent
- Threshold accepting heuristic for fair flow optimization in wireless mesh networks
- How to allocate hard candies fairly
- Fair and square: cake-cutting in two dimensions
- Fair Share
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- Quantum bargaining games
- Proportional pie-cutting
- 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
- The price of fairness for indivisible goods
- Cooperation in dividing the cake
- Impartial division of a dollar
- Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
- On existence of truthful fair cake cutting mechanisms
- Fair (and not so fair) division
- Fair Division
- Linear versus nonlinear allocation rules in risk sharing under financial fairness
- Fair cake-cutting in practice
- A fair procedure in insurance
- How to divide things fairly
- Constructing a Fair Border
- Cutting a cake for infinitely many guests
- Envy-free allocations respecting social networks
- Computation of the random arrival rule for bankruptcy problems
- Bidding strategies for fantasy-sports auctions
- Envy-free matchings in bipartite graphs and their applications to fair division
- Cutting a Cake Fairly for Groups Revisited
- Countering negotiation power asymmetries by using the adjusted winner algorithm
- How to cut a cake with a Gram matrix
- On maximin share allocations in matroids
- Santa Claus Meets Hypergraph Matchings
- Efficient Fair Division with Minimal Sharing
- Truthful Fair Division
- Ex-ante estate division under strong Pareto efficiency
- 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
- Sharing rewards among strangers based on peer evaluations
- Envy-free divisions
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Do transitive preferences always result in indifferent divisions?
- The Shapley value in the Knaster gain game
- Consensus Halving for Sets of Items
- Three persons, two cuts: a new cake-cutting algorithm
- Allocation rules for land division
- Nondiscrimination and monotonicity in fair division
- Fair in the Eyes of Others
- A protocol for cutting matroids like cakes
- Multi resource allocation with partial preferences
- Dissolving a partnership securely
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Approximate maximin share allocations in matroids
- A `divide and choose' approach to compromising
- Divide-and-permute
- A cake for Cournot
- A fair division solution to the problem of redistricting
- Fair division with multiple pieces
- Collective decision making
- Weighted fair division of indivisible items: a review
- EFX allocation to chores over small graph
- Hardness results for consensus-halving
- Cake-cutting with different entitlements: how many cuts are needed?
- Computing fair and efficient allocations with few utility values
- Consensus-Halving: Does It Ever Get Easier?
- A discrete and bounded locally envy-free cake cutting protocol on trees
- Approximate envy-freeness in graphical 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)
