Provider: JSTOR http://www.jstor.org
Database: JSTOR
Content: text/plain; charset="us-ascii"
TY - CHAP
TI - Example:
AU - Prisner, Erich
AB - We assume that the items may have different values to Ann and Beth, that the players know how they both value each item, and that the game’s total value to a player is the sum of the values of the items she got. Both players want to get as much value as possible. Let us label the items as item*C, D,*. . . and let*a(C)*and*b(C)*denote the values of item*C*for Ann and Beth, and so on. Isn’t the way how to play these games obvious? Wouldn’t each player choose the most valuable remaining
EP - 76
ET - 1
PB - Mathematical Association of America
PY - 2014
SN - null
SP - 70
T1 - Dividing A Few Items I
T2 - Game Theory Through Examples
UR - http://www.jstor.org/stable/10.4169/j.ctt6wpwgj.12
Y2 - 2020/09/18/
ER -