Book Club-"Cake Cutting: Be Fair if you Can" - Meeting 1

  1. Finite Cutting Methods

    1. Discuss notion of envy-freeness and fairness

    2. Describe Banach-Knaster last diminisher protocol

      1. Show time complexity

    3. Describe Sequential pairs protocol

      1. Show time complexity

    4. Describe Even-Paz protocol

      1. Show time complexity

    5. Describe Selfridge-Conway protocol

  2. Describe moving knife protocols

    1. Dubins-Spanier protocol for n players

    2. Stromquist envy-free protocol for n=3 players

  3. Describe "Single Cut Suffices"

    1. Improve sequential pairs protocol

  4. Revise problem set

\section{Finite Cutting Methods} \subsection{What are envy-freeness and fairness?} \subsection{Last Diminisher} \subsection{Sequential pairs} \subsection{Even-Paz} \subsection{Selfridge-Conway} \section{Moving Knife} \subsection{Dubins-Spanier} \subsection{Stromquist} \section{Single-Cut Principle}

No comment found.

Add a comment

You must log in to post a comment.

Site Maintenance

Our platform is currently undergoing maintenance. We apologize for any inconvenience. Please check back later.