Masayuki Abe & Koutarou Suzuki (2002):
M+1-st Price Auction Using Homomorphic Encryption.
In: David Naccache & Pascal Paillier: Public Key Cryptography,
Lecture Notes in Computer Science 2274.
Springer Berlin / Heidelberg,
pp. 395–398,
doi:10.1007/3-540-45664-3_8.
10.1007/3-540-45664-3_8.
S.J. Brams & A.D. Taylor (1996):
Fair division: from cake-cutting to dispute resolution.
Cambridge University Press.
Gilles Brassard, David Chaum & Claude Crépeau (1988):
Minimum disclosure proofs of knowledge.
J. Comput. Syst. Sci. 37,
pp. 156–189,
doi:10.1016/0022-0000(88)90005-0.
Costas Busch, Mukkai S. Krishnamoorthy & Malik Magdon-Ismail (2005):
Hardness Results for Cake Cutting.
Bulletin of the EATCS 86,
pp. 85–106.
L. E. Dubins & E. H. Spanier (1961):
How to Cut A Cake Fairly.
The American Mathematical Monthly 68(1),
pp. 1–17,
doi:10.2307/2311357.
Jeff Edmonds & Kirk Pruhs (2006):
Cake cutting really is not a piece of cake.
In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm,
SODA '06.
ACM,
New York, NY, USA,
pp. 271–278,
doi:10.1145/1109557.1109588.
S. Even & A. Paz (1984):
A note on cake cutting.
Discrete Applied Mathematics 7(3),
pp. 285 – 296,
doi:10.1016/0166-218X(84)90005-2.
Oded Goldreich, Silvio Micali & Avi Wigderson (1991):
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems.
J. ACM 38,
pp. 690–728,
doi:10.1145/116825.116852.
H.W. Kuhn (1967):
On Games of Fair Division.
In: Essays in Mathematical Economics in Honor of Oskar Morgenstern.
Princeton University Press.
Kaoru Kurosawa & Wakaha Ogata (2002):
Bit-Slice Auction Circuit.
In: Proceedings of the 7th European Symposium on Research in Computer Security,
ESORICS '02.
Springer-Verlag,
London, UK, UK,
pp. 24–38,
doi:10.1007/3-540-45853-0_2.
Yoshifumi Manabe & Tatsuaki Okamoto (2010):
Meta-envy-free cake-cutting protocols.
In: Proceedings of the 35th international conference on Mathematical foundations of computer science,
MFCS'10.
Springer-Verlag,
Berlin, Heidelberg,
pp. 501–512,
doi:10.1007/978-3-642-15155-2_44.
Takuho Mitsunaga, Yoshifumi Manabe & Tatsuaki Okamoto (2010):
Efficient secure auction protocols based on the Boneh-Goh-Nissim encryption.
In: Proceedings of the 5th international conference on Advances in information and computer security,
IWSEC'10.
Springer-Verlag,
Berlin, Heidelberg,
pp. 149–163,
doi:10.1007/978-3-642-16825-3_11.
J. Robertson & W. Webb (1991):
Minimal Number of Cuts for Fair Division.
Arts. Comb. 31,
pp. 191 – 197.
J. Robertson & W. Webb (1998):
Cake-cutting algorithms: be fair if you can.
Ak Peters Series.
A.K. Peters.
T.L. Saaty (1970):
Optimization in integers and related extremal problems.
International series in pure and applied mathematics.
McGraw-Hill.
Jiri Sgall & Gerhard Woeginger (2003):
A Lower Bound for Cake Cutting.
In: Giuseppe Di Battista & Uri Zwick: Algorithms - ESA 2003,
Lecture Notes in Computer Science 2832.
Springer Berlin / Heidelberg,
pp. 459–469,
doi:10.1007/978-3-540-39658-1_42.
H. Steinhaus (1948):
The Problem of Fair Division.
Econometrica 16,
pp. 101 – 104.
H. Steinhaus (1969):
Mathematical Snapshots.
Oxford University Press.
eptcs@eptcs.org