enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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

  3. 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.

  4. 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 ...

  5. Robertson–Webb query model - Wikipedia

    en.wikipedia.org/wiki/Robertson–Webb_query_model

    Informally, an Eval query asks an agent to specify his/her value to a given piece of the cake, and a Cut query (also called a Mark query) asks an agent to specify a piece of cake with a given value. Despite the simplicity of the model, many classic cake-cutting algorithms can be described only by these two queries.

  6. Fair cake-cutting - Wikipedia

    en.wikipedia.org/wiki/Fair_cake-cutting

    The "cake" is only a metaphor; procedures for fair cake-cutting can be used to divide various kinds of resources, such as land estates, advertisement space or broadcast time. The prototypical procedure for fair cake-cutting is divide and choose, which is mentioned in the book of Genesis to resolve Abraham and Lot's conflict. This procedure ...

  7. 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 ...

  8. 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 ...

  9. Cake-cutting - Wikipedia

    en.wikipedia.org/wiki/Cake-cutting

    Cake-cutting may refer to: Fair cake-cutting, a mathematical problem of fairly dividing a heterogenous resource among people with different preferences Efficient cake-cutting, a similar division problem in economics and computer science; Wedding-cake cutting, the habit of cutting the wedding cake and distributing it to the guests, as a symbol ...