Almost envy-free allocations with connected bundles

Uloženo v:

Podrobná bibliografie
Vydáno v:	Games and Economic Behavior Ročník 131; s. 197 - 221
Hlavní autoři:	Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker
Médium:	Journal Article
Jazyk:	japonština
Vydáno:	Elsevier BV 01.01.2022
Témata:	[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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!