Possible papers for the seminar The assignment game I: The core L. S. Shapley, M. Shubik Matching with Contracts. Hatfield and Millgrom

First Page		Document Content
Date: 2015-03-18 18:04:34 Fellows of the Econometric Society Jewish surnames Surname Economics Genealogy Fair division Tayfun Snmez Envy-free cake-cutting Aumann Alvin E. Roth Segal Snmez		Possible papers for the seminar The assignment game I: The core L. S. Shapley, M. Shubik Matching with Contracts. Hatfield and Millgrom Add to Reading List Source URL: u.cs.biu.ac.il Download Document from Source Website File Size: 15,61 KB Share Document on Facebook

	A Discrete and Bounded Envy-free Cake Cutting Protocol for Any Number of Agents HARIS AZIZ, Data61, CSIRO and UNSW Australia and SIMON MACKENZIE, Data61, CSIRO and UNSW Australia We consider the well-studied cake cuttin DocID: 1thOk - View Document
	A Discrete and Bounded Envy-Free Cake Cutting Protocol for Four Agents Haris Aziz Simon Mackenzie DocID: 1tbFR - View Document
	Possible papers for the seminar The assignment game I: The core L. S. Shapley, M. Shubik Matching with Contracts. Hatfield and Millgrom DocID: 1rfLZ - View Document
	EuroCG 2016, Lugano, Switzerland, March 30–April 1, 2016 Fair and Square: Cake-Cutting in Two Dimensions Erel Segal-Halevi Shmuel Nitzan DocID: 1qXvo - View Document
	Online cake cutting Toby Walsh NICTA and UNSW Sydney, Australia Email: [removed] Abstract. We propose an online form of the cake cutting problem. This models situations where agents arrive and depart durin DocID: ZV61 - View Document