In computer science, the Robertson–Webb (RW) query model is a model of computation used by algorithms for the problem of fair cake-cutting. In this problem...

Cell-probe model Robertson–Webb query model Chomsky hierarchy Turing completeness "Models of Computation" (PDF). Fernández, Maribel (2009). Models of Computation:...

be infinite. Does not guarantee near-exactness. Robertson–Webb query model Robertson, Jack M.; Webb, William A. (1997). "Near exact and envy free cake...

of algorithms requires a model of computation. Several such models are common in the literature: The Robertson–Webb query model – in which the algorithm...

of queries. An envy-free division with connected pieces for 3 or more agents cannot be found by a finite protocol in the Robertson–Webb query model. The...

strong-substitutes demand. Oracle machine Demand curve Robertson-Webb query model - a similar query model in the domain of cake-cutting. Vondrak, Jan (2008-05-17)...

iterations. Therefore, the total number of queries in the Robertson-Webb query model is O(n2) per agent, and O(n3) overall. This is much more than required...

the Robertson–Webb query model, even for 2 agents. Moreover, for any ε > 0: A connected ε-equitable cake-cutting requires at least Ω(log ε−1) queries. For...

However, they cannot be found using a finite algorithm in the Robertson–Webb query model. Democratic fairness: 1/2-democratic proportional and 1/2-democratic...

are stated in terms of the Robertson–Webb query model, i.e., they relate to procedures asking the agents two types of queries: "Evaluate" and "Mark". Every...