Search results
Results from the WOW.Com Content Network
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 ...
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 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.
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.
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.
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 ...
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more
The Brams–Taylor procedure (BTP) is a procedure for envy-free cake-cutting.It explicated the first finite procedure to produce an envy-free division of a cake among any positive integer number of players. [1]