Sperner's lemma and fair division

Larisa Dakskobler (2016) Sperner's lemma and fair division. EngD thesis.

Preview

Abstract

Fair division is an active research area in Mathematics, Economics, Computer Science, etc. There are many different kinds of fair division problems. These are often named after everyday situations: fair resource allocation, fair cake-cutting, fair chore division, room assignment – rent division, and more. Although many exact and approximative methods for finding fair solutions already exist, the area of fair division still expands and tries to find better solutions for everyday problems. The objective of the thesis was to find, present and compare methods based on Sperner's Lemma, that can be used for solving different fair division problems. The thesis presents next approximative methods: Simmons' approach to cake-cutting, Su's approach to room assignment – rent division and Scarf's method for computation of equilibrium prices. An application with graphical user interface was build, which allows us to try out described methods in different test scenarios.

Item Type:

Thesis (EngD thesis)

Keywords:

fair division, Sperner's Lemma, cake-cutting, room assignment – rent division

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
prof. dr. Neža Mramor- Kosta	242	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536878019)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3289

Date Deposited:

18 Mar 2016 14:06

Last Modified:

20 Apr 2016 09:17

URI:

http://eprints.fri.uni-lj.si/id/eprint/3289

Actions (login required)

View Item