Divide and choose (also Cut and choose or I cut, you choose) is a procedure for envy-free cake-cutting between two partners. It involves aâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

Classic cake cutting protocols â€” which fairly allocate a divisible good among agents with heterogeneous preferences â€” areâ€¦Â (More)

Is this relevant?

2011

2011

- JÃ©rÃ©my Laurent-Lucchetti, Justin Leroux
- Games and Economic Behavior
- 2011

Implementing a project, like a nationwide nuclear waste disposal, which beneÂ…ts all involved agents but brings major costs onlyâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Vipul Goyal, Payman Mohassel, Adam D. Smith
- EUROCRYPT
- 2008

Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covertâ€¦Â (More)

Is this relevant?

2008

2008

- Natasha Dobrinen
- 2008

We characterize the (Îº, Î»,< Î¼)-distributive law in Boolean algebras in terms of cut and choose games G <Î¼(Î»), when Î¼ â‰¤ Îº â‰¤ Î» andâ€¦Â (More)

Is this relevant?

2008

2008

- Grzegorz Stachowiak
- IACR Cryptology ePrint Archive
- 2008

In this paper we consider the problem of increasing the number of possible challenge values from 2 to s in various zero-knowledgeâ€¦Â (More)

Is this relevant?

2007

2007

In an National Football League overtime, a coin is tossed to determine which team will receive the kick off. In the sudden deathâ€¦Â (More)

Is this relevant?

2006

2006

Working together in collaborative virtual environments (CVEs) with different systems is often problematic; different capabilitiesâ€¦Â (More)

Is this relevant?

1999

1999

- Vijay Varadharajan, Khanh Quoc Nguyen, Yiming Mu
- Theor. Comput. Sci.
- 1999

Electronic cash is arguably one of the most important applications of modern cryptology. There have been two types of electronicâ€¦Â (More)

Is this relevant?

1995

1995

- Jindrich Zapletal
- Ann. Pure Appl. Logic
- 1995

We improve on the results of [Vel] and give some examples. In [Jech], a number of infinite games on (complete) Boolean algebrasâ€¦Â (More)

Is this relevant?

1986

1986

- Boban Velickovic
- 1986

We show that for an atomless complete Boolean algebra 8 of density < 2NÂ°, the Banach-Mazur, the split and choose, and the Ulamâ€¦Â (More)

Is this relevant?