Expand the shares together: envy-free mechanisms with a small number of cuts
type: Item
instance of: scholarly article
title: Expand the shares together: envy-free mechanisms with a small number of cuts
zbMATH Open document ID: 1426.91148
author: Masoud Seddighin
author: Majid Farhadi
author: Mohammad Ghodsi
author: Reza Alijani
author: Ahmad S. Tajik
published in: Algorithmica
publication date: 2019-04-25T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 91A40
zbMATH DE Number: 7047711
zbMATH Keywords: cake cutting
zbMATH Keywords: envy-free
zbMATH Keywords: mechanism design
zbMATH Keywords: approximation
zbMATH Keywords: fairness
MaRDI profile type: Publication
full work available at URL: s00453-018-0500-z
OpenAlex ID: W2886807769
cites work: A discrete and bounded envy-free cake cutting protocol for four agents
cites work: Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
cites work: Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
cites work: Q5450059
cites work: An Envy-Free Cake Division Protocol
cites work: Truth, justice, and cake cutting
cites work: Algorithmic Solutions for Envy-Free Cake Cutting
cites work: Cake Cutting Algorithms
cites work: How to Cut a Cake Fairly
cites work: Envy-free cake divisions cannot be found by finite protocols
DOI: 10.1007/S00453-018-0500-Z
description: scientific article; zbMATH DE number 7047711