scientific article; zbMATH DE number 1015852
From MaRDI portal
Publication:4338900
Dissections and valuations (Hilbert's third problem, etc.) (52B45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) (n)-person games, (n>2) (91A06) 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)
Recommendations
Cited in
(only showing first 100 items - show all)- Disputed lands
- On envy-free cake division
- Maximin share and minimax envy in fair-division problems.
- A fair procedure in insurance
- Fair-negotiation procedures
- On the structure of Pareto optimal cake partitions
- Quantum bargaining games
- Strategic step-by-step negotiation
- How to cut a cake with a Gram matrix
- On maximin share allocations in matroids
- Procedurally fair implementation under complete information
- Divide and compromise
- The Shapley value in the Knaster gain game
- A multi-objective interpretation of optimal transport
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- How to be fairer
- Price of fairness in two-agent single-machine scheduling problems
- Handling preferences in student-project allocation
- Resource-monotonicity and population-monotonicity in connected cake-cutting
- Price of fairness for allocating a bounded resource
- 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
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Fair division with no information
- Allocation rules for land division
- When \textit{I cut, you choose} method implies intransitivity
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Quantum English auctions
- The adjusted Knaster procedure under unequal entitlements.
- About inheritance distribution.
- Auctions with bidder-determined allowable combinations
- Old and new moving-knife schemes
- Cooperative models for allocating an object
- An algorithm for super envy-free cake division
- On the existence of Pareto efficient and envy-free allocations
- Picking sequences and monotonicity in weighted fair division
- Almost envy-free allocations with connected bundles
- The price of fairness for a two-agent scheduling game minimizing total completion time
- 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
- Cutting a cake for infinitely many guests
- Envy-free allocations respecting social networks
- Sharing the surplus and proportional values
- On the existence of EFX allocations
- Dissolving a partnership securely
- The fair division of hereditary set systems
- Fair division with multiple pieces
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination
- The price to pay for forgoing normalization in fair division of indivisible goods
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
- The price of fairness for indivisible goods
- Fair division of mixed divisible and indivisible goods
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Ex-ante estate division under strong Pareto efficiency
- Knapsack cost sharing
- Finding maxmin allocations in cooperative and competitive fair division
- Two-player envy-free multi-cake division
- Multiagent resource allocation in k-additive domains: preference representation and complexity
- Fair cake-cutting among families
- Generalized backward induction: justification for a folk algorithm
- The return function: a new computable perspective on Bayesian-Nash equilibria
- 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
- Threshold accepting heuristic for fair flow optimization in wireless mesh networks
- Fair optimization and networks: a survey
- A strategic approach to multiple estate division problems
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Shadow prices in territory division
- Fair and square: cake-cutting in two dimensions
- Divide-and-permute
- Don't let the lawyers do the math: Some problems of legislative districting in the UK and the USA
- The composite iteration algorithm for finding efficient and financially fair risk-sharing rules
- Existence of a simple and equitable fair division: a short proof
- A `divide and choose' approach to compromising
- The undercut procedure: an algorithm for the envy-free division of indivisible items
- Computation of the random arrival rule for bankruptcy problems
- How to allocate hard candies fairly
- On the complexity of cake cutting
- Impartial division of a dollar
- Some comments on history based structures
- Fair (and not so fair) division
- Proportional pie-cutting
- Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
- A paradoxical Pareto frontier in the cake-cutting context
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Fair multi-cake cutting
- 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
- Fair cake-cutting in practice
- On maximum weighted Nash welfare for binary valuations
- Fair cake-cutting for imitative agents
- Multi resource allocation with partial preferences
- A parametric worst-case approach to fairness in cooperative games with transferable utility
- Approximate envy-free procedures
- Cost-efficient equitable water distribution in Algeria: a bicriteria fair division problem with network constraints
- A protocol for cutting matroids like cakes
- Fair division and redistricting
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)
