b*********n
发帖数: 1258 | 1 两个人分两个饼,A总是Cut.B有一个First Pick Option.
问A如何Cut才能得到最多的饼?一个典型的优化问题
答案是每个人一半吧
可以拿到更多吗？ |
f****f
发帖数: 154 | 2 这个是game theory里的经典案例，去搜一下就知道~ |
m*****f
发帖数: 1243 | 3 我搜了还是不知道， 能说说么
【在 f****f 的大作中提到】
: 这个是game theory里的经典案例，去搜一下就知道~
|
f****f
发帖数: 154 | 4 Proportional division or simple fair division is the original and simplest
problem in fair division. Fair division problems are also called cake-
cutting problems. A proportional division of a cake between N people would
ensure each of them got at least 1 / N of the cake by their own valuation.
The cake can have an irregular structure, for instance a fruit-cake with
icing, and the recipients may value the different parts differently. There
is no requirement for a division to be envy-free.
For tw
【在 m*****f 的大作中提到】
: 我搜了还是不知道， 能说说么
|
m*****f
发帖数: 1243 | 5 就这道题来说， 就是最多1/2是么?
就是说lz说的是对的?
【在 f****f 的大作中提到】
: Proportional division or simple fair division is the original and simplest
: problem in fair division. Fair division problems are also called cake-
: cutting problems. A proportional division of a cake between N people would
: ensure each of them got at least 1 / N of the cake by their own valuation.
: The cake can have an irregular structure, for instance a fruit-cake with
: icing, and the recipients may value the different parts differently. There
: is no requirement for a division to be envy-free.
: For tw
|
