scientific article; zbMATH DE number 1234106
From MaRDI portal
Publication:4221107
Recommendations
Cited in
(only showing first 100 items - show all)- Disputed lands
- Maximin share and minimax envy in fair-division problems.
- How to cut a cake with a Gram matrix
- Sequential analogues of the Lyapunov and Krein-Milman theorems in Fréchet spaces
- Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- Approximating fair division with a limited number of cuts
- On the computability of equitable divisions
- Almost envy-free allocations with connected bundles
- 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
- Dissolving a partnership securely
- Fairness and efficiency in cake-cutting with single-peaked preferences
- 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
- Fair division of mixed divisible and indivisible goods
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Two-player envy-free multi-cake division
- Fair cake-cutting among families
- 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
- An equilibrium analysis of Knaster's fair division procedure
- Fair and square: cake-cutting in two dimensions
- Existence of a simple and equitable fair division: a short proof
- On the complexity of cake cutting
- Fair (and not so fair) division
- Proportional pie-cutting
- 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
- When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores
- Fair cake-cutting in practice
- Fair cake-cutting for imitative agents
- Thou shalt covet the average of thy neighbors' cakes
- A doubly exponentially crumbled cake
- Sharing rewards among strangers based on peer evaluations
- A geometric approach to fair division
- Cutting cakes carefully
- A majority model in group decision making using QMA-OWA operators
- Dissolving a partnership dynamically
- Envy-Free Division of Land
- A heuristic optimization of Bayesian incentive-compatible cake-cutting
- Distributed fair allocation of indivisible goods
- Approximation algorithms for computing maximin share allocations
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- Approximating the Nash Social Welfare with Indivisible Items
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- A note on envy-free cake cutting with polynomial valuations
- Majority additive-ordered weighting averaging: A new neat ordered weighting averaging operator based on the majority process
- Two-person cake cutting: the optimal number of cuts
- On fair division of a homogeneous good
- Fairly allocating many goods with few queries
- Competitive equilibrium with indivisible goods and generic budgets
- Hardness results for consensus-halving
- Dividing connected chores fairly
- Nash social welfare approximation for strategic agents
- How to divide when there isn't enough. From Aristotle, the Talmud, and Maimonides to the axiomatics of resource allocation
- Almost envy-free allocations with connected bundles
- Contiguous cake cutting: hardness results and approximation algorithms
- Cake cutting algorithms
- How to cut a cake fairly: a generalization to groups
- Fair Division
- Mathematical muffin morsels. Nobody wants a small piece
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Extremal characteristics of statistical criteria with given total variation distances between hypotheses
- Fair Cake Division Under Monotone Likelihood Ratios
- Cutting polygons into small pieces with chords: Laser-based localization
- Cutting a Cake Fairly for Groups Revisited
- Envy-free division of discrete cakes
- Envy-free division of discrete cakes
- The Dubins-Spanier optimization problem in fair division theory
- On guarantees, vetoes, and random dictators
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
- Strategy-proof and envy-free mechanisms for house allocation
- On fair division with binary valuations respecting social networks
- Keep your distance: land division with separation
- Fair Share
- Envy-free matchings in bipartite graphs and their applications to fair division
- On existence of truthful fair cake cutting mechanisms
- The language of social software
- Approximating Nash social welfare by matching and local search
- EFX allocations for indivisible chores: matching-based approach
- Almost proportional allocations of indivisible chores: computation, approximation and efficiency
- Approval-based voting with mixed goods
- Weighted fair division of indivisible items: a review
- Fair division with allocator's preference
- A discrete and bounded locally envy-free cake cutting protocol on trees
- Approximate envy-freeness in graphical cake cutting
- Logarithmic algorithms for fair division problems
- EFX allocations for indivisible chores: matching-based approach
- Dividing a graphical cake
- Welfare loss in connected resource allocation
- Between proportionnality and envy-freeness: k-proportionality
- Proportional allocations of multi-layered cakes
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 Q4221107)
