如果 budget 係 $110, 會突然唔同哂: A 可以大膽首叫 $10, 首先 B 唔可能叫 > $100 (由無賺無蝕變蝕至少 $1); 然後 B 如果叫 [$20, $100] 咁 A 叫 $110 B 即刻收皮 (A 唔會蝕多過 $10)
陣間繼續寫
壽司大王2018-10-25 03:42:26
p = probability of opponent dropping out
E(r(i))= p(i)* $100 + (1-p(i)) * $0 - E(r(i-1))
屠鳩你2018-10-25 03:42:45
你唔諗a出完101 b咪一定同你跟落去 咁你a9咪唔成立lo
屠鳩你2018-10-25 03:46:20
a91一樣 b一定叫150 因為佢知你a會再叫 所以a91都唔成立
屠鳩你2018-10-25 03:49:07
你地簡單一句loop就算
無諗過點loop法 最後邊個得益
倒推結果 a唔會咁做害自己
壽司大王2018-10-25 03:50:06
呢題dollar auction 最基本要用到backward thinking ,如果唔知咩係backward thinking 可以參考一下以下pirate game
There are 5 rational pirates (in strict order of seniority A, B, C, D and E) who found 100 gold coins. They must decide how to distribute them.
The pirate world's rules of distribution say that the most senior pirate first proposes a plan of distribution. The pirates, including the proposer, then vote on whether to accept this distribution. If the majority accepts the plan, the coins are dispersed and the game ends. In case of a tie vote, the proposer has the casting vote. If the majority rejects the plan, the proposer is thrown overboard from the pirate ship and dies, and the next most senior pirate makes a new proposal to begin the system again. The process repeats until a plan is accepted or if there is one pirate left.[1]
Pirates base their decisions on four factors. First of all, each pirate wants to survive. Second, given survival, each pirate wants to maximize the number of gold coins each receives. Third, each pirate would prefer to throw another overboard, if all other results would otherwise be equal.[2] And finally, the pirates do not trust each other, and will neither make nor honor any promises between pirates apart from a proposed distribution plan that gives a whole number of gold coins to each pirate.
壽司大王2018-10-25 03:57:07
點解b要弄a先?a有咩好處先?如果大家想弄對方又有咩條件支持先?假設b lose $1 = a gain $x 或者b 係fully rational 要用probability 做呢題