We study the classic cake cutting problem from a mechanism design perspective, in particular focusing on deterministic mechanisms that are strategyproof and fair. We begin by looking at mechanisms that are non-wasteful and primarily show that for even the restricted class of piecewise constant valuations there exists no direct-revelation mechanism that is strategyproof and even approximately pr...

Let C be a binary extremal self-dual doubly-even code of length n ≥ 48. If such a code has an automorphism σ of prime order p ≥ 5 then the number of fixed points in the permutation action on the coordinates is bounded by the number of p-cycles. It turns out that large primes p, i.e. n − p small, occur extremely rarely in Aut(C). Examples are the extended quadratic residue codes. We prove that d...

this article discusses what ethicists have called “unacceptable trade-offs” in health policy choices related to universal health coverage (uhc). since the fiscal space is constrained, trade-offs need to be made. but some trade-offs are unacceptable on the path to universal coverage. unacceptable choices include, among other examples from low-income countries, to expand coverage for services wit...