>
you're reading...
Announcements

SACT Seminar: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

Time: 1:00pm Tuesday, 3rd May 2016.

Location: SIT 459

Speaker: Simon Mackenzie, Data61

Title: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

Abstract:
We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from the agents. The problem has received attention in computer science, mathematics, and economics. It has been a major open problem whether there exists a bounded and discrete envy-free protocol. We resolve the problem by proposing a discrete and bounded envy-free protocol for any number of agents.

Advertisements

Discussion

3 thoughts on “SACT Seminar: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

  1. I can’t make this – but I really want to see the paper!

    Posted by Michael Charleston | April 28, 2016, 3:50 pm
  2. I have no association with Sydney University. Can I attend this?

    Posted by some505 | April 29, 2016, 2:58 pm

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 61 other followers

%d bloggers like this: