4 ms·
This game is difficult to formalise because of the real time bidding aspect. Say agents pre-commit to bid or not in discrete time periods, one Nash Equilibrium
by oli5679 10y ago
This game is difficult to formalise because of the real time bidding aspect.
Say agents pre-commit to bid or not in discrete time periods, one Nash Equilibrium would be symmetrical mixed strategies such that each agent has 0 expected payoff from bidding.
Eg if 10 players, $0.4 fee and $0.5 bid then would need players to bid with probability p st:
0.9 = 180 *(1-p) ^9.
This changes if agents value winning more/less than $180 in present/future (patience, risk neutrality, value placed on tablet + process of playing gambling game).
- oli5679 10y agoEdit: Thinking a bit more about this, the real time bidding aspect isn't really a problem. You do need to know how many other players there are now/in the future though. Symmetrical strategies: bid_cost(t) = object_value * (1-p(t+1))^N-2 for all t, for all agents not currently winning auction is a MSNE.