Almost envy-free allocations with connected bundles

Saved in:
Bibliographic Details
Published in:Games and Economic Behavior Vol. 131; pp. 197 - 221
Main Authors: Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Format: Journal Article
Language:Japanese
Published: Elsevier BV 01.01.2022
Subjects:
[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
[INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT]
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]
[SHS.ECO]Humanities and Social Sciences/Economics and Finance
Algorithmic Game Theory
Algorithmic game theory, Cake-cutting, Envy-free division, Resource allocation
Cake-cutting
Computer Science - Computer Science and Game Theory
Computer Science and Game Theory (cs.GT)
Economics - Theoretical Economics
Envy-free Division
Envy-free Division, Cake-cutting, Resource Allocation, Algorithmic Game Theory
FOS: Computer and information sciences
FOS: Economics and business
Resource Allocation
Theoretical Economics (econ.TH)
ISSN:0899-8256
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
ISSN:0899-8256
DOI:10.4230/lipics.itcs.2019.14