TU Berlin

Research Group Algorithmics and Computational ComplexityTalk 01.12.2016

isti-logo

Page Content

to Navigation

Online Fair Division

Martin Aleksandrov (TU Berlin)

 

Online Fair Division is a framework that allows us to distribute resources to agents. Unlike its offline counterpart, the resources in Online Fair Division arrive over time and must be allocated immediately to agents. We propose a model for Online Fair Division and two randomized mechanisms for it: LIKE and BALANCED LIKE. We also adopt standard concepts from Offline Fair Division such as strategy-proofness, envy-freeness and Pareto efficiency to Online Fair Division, completely characterize these properties and show that LIKE and BALANCED LIKE mechanisms are the only mechanisms that satisfy some of these properties. Finally, we investigate their computational properties and conclude with a small experiment.

 

Date
Speaker
Location
Language
01.12.2016
16:15
Martin Aleksandrov
TEL 512
English

Back to the research colloquium site.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe