enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Robertson–Webb envy-free cake-cutting algorithm - Wikipedia

    en.wikipedia.org/wiki/Robertson–Webb_envy-free...

    The main difficulty in designing an envy-free procedure for n > 2 agents is that the problem is not "divisible".I.e., if we divide half of the cake among n/2 agents in an envy-free manner, we cannot just let the other n/2 agents divide the other half in the same manner, because this might cause the first group of n/2 agents to be envious (e.g., it is possible that A and B both believe they got ...

  3. Divide and choose - Wikipedia

    en.wikipedia.org/wiki/Divide_and_choose

    Divide and choose (also Cut and choose or I cut, you choose) is a procedure for fair division of a continuous resource, such as a cake, between two parties. It involves a heterogeneous good or resource ("the cake") and two partners who have different preferences over parts of the cake (both want as much of it as possible). The procedure ...

  4. Category:Cake-cutting - Wikipedia

    en.wikipedia.org/wiki/Category:Cake-cutting

    Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more

  5. Truthful cake-cutting - Wikipedia

    en.wikipedia.org/wiki/Truthful_cake-cutting

    The classic divide and choose procedure for cake-cutting is not truthful: if the cutter knows the chooser's preferences, they can get much more than 1/2 by acting strategically. For example, suppose the cutter values a piece by its size while the chooser values a piece by the amount of chocolate in it.

  6. Queen Elizabeth insists on slicing a cake in a very 'unusual ...

    www.aol.com/news/queen-elizabeth-insists-slicing...

    Why cut a cake with a knife when there’s a ceremonial sword available? On Friday, Queen Elizabeth II attended an afternoon reception in Cornwall, England with Catherine, Duchess of Cambridge ...

  7. Stromquist moving-knives procedure - Wikipedia

    en.wikipedia.org/wiki/Stromquist_moving-knives...

    The Stromquist moving-knives procedure is a procedure for envy-free cake-cutting among three players. It is named after Walter Stromquist who presented it in 1980. [1] This procedure was the first envy-free moving knife procedure devised for three players. It requires four knives but only two cuts, so each player receives a single connected piece.

  8. Austin moving-knife procedures - Wikipedia

    en.wikipedia.org/wiki/Austin_moving-knife_procedures

    Alice places one knife on the left of the cake and a second parallel to it on the right where she judges it splits the cake in two. Alice moves both knives to the right in a way that the part between the two knives always contains half of the cake's value in her eyes (while the physical distance between the knives may change). George says "stop!"

  9. Symmetric fair cake-cutting - Wikipedia

    en.wikipedia.org/wiki/Symmetric_fair_cake-cutting

    Symmetric fair cake-cutting is a variant of the fair cake-cutting problem, in which fairness is applied not only to the final outcome, but also to the assignment of roles in the division procedure. As an example, consider a birthday cake that has to be divided between two children with different tastes, such that each child feels that his/her ...