Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,515,981 papers from all fields of science
Search
Sign In
Create Free Account
Divide and choose
Known as:
Cut and choose
, I cut, you choose
, Split and choose
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Adjusted winner procedure
Chore division
Fink protocol
Last diminisher
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Guarantees in Fair Division: beyond Divide & Choose and Moving Knifes
Anna Bogomolnaia
,
H. Moulin
,
R. Stong
2019
Corpus ID: 208248126
Divide and Choose among two agents, and the Diminishing Share (DS) and Moving Knife (MK) algorithms among many, elicit…
Expand
2017
2017
Divide and compromise
Antonio Nicoló
,
R. Velez
Mathematical Social Sciences
2017
Corpus ID: 23690769
2016
2016
The costs and benefits of symmetry in common-ownership allocation problems
Alexander L. Brown
,
R. Velez
Games Econ. Behav.
2016
Corpus ID: 6321755
2015
2015
2-2015 An Algorithmic Framework for Strategic Fair Division
Simina Brânzei
,
I. Caragiannis
,
David Kurokawa
2015
Corpus ID: 6670830
We study the paradigmatic fair division problem of fairly allocating a divisible good among agents with heterogeneous preferences…
Expand
2014
2014
Encrypted Receipts for Voter-Verified Elections Using Homomorphic Encryption by Joy
Marie Forsythe
2014
Corpus ID: 261371847
Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic…
Expand
2013
2013
Hybrid Vehicle (City Bus) Optimal Power Management for Fuel Economy Benchmarking
B. Adel
,
Youtong Zhang
,
C. Ni
,
J. Wei
2013
Corpus ID: 58917238
In this paper a global optimization method (dynamic programming) is used to find the optimal power management in hybrid electric…
Expand
2008
2008
κ-stationary subsets of , infinitary games, and distributive laws in Boolean algebras
Natasha Dobrinen
Journal of Symbolic Logic (JSL)
2008
Corpus ID: 11159463
Abstract We characterize the (κ, λ, < μ)-distributive law in Boolean algebras in terms of cut and choose games , when…
Expand
2004
2004
Lecture 22: Voter Veriflcation in Mix-net Voting Systems
2004
Corpus ID: 62103158
Any voting system is required to be verifiable. Namely, it is required that each voter can verify that his vote was counted…
Expand
2000
2000
Subliminal channel that defeats the cut and choose method and the analysis of its bandwidth
Zhang Tong
2000
Corpus ID: 124518869
The cut and choose method is an effective method in the safe use of electronic currency. But it is infeasible to close the…
Expand
1994
1994
More on the Cut and Choose Game
J. Zapletal
Annals of Pure and Applied Logic
1994
Corpus ID: 17397136
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE