Project: SHUBIK AUCTION(A,B,n):
Two players, Adam and Bob, bid sequentially for an item. worth A units for Ann and B units for Beth.
The bids must increase in increments of 10.
Adam starts by either bidding 10 or by passing (in which case, Beth gets the item for nothing).
If Adam bids 10, Beth can bid 20 or pass, and so on.
After one player passes, the other player gets the item for her highest bid,
but different to ordinary auctions, the other player still has to pay her highest bid
but gets nothing in return. There is a fixed maximum number n of rounds.
Explain what happens for different parameters A, B, and n. For example you could start with
- A=25, B=35, n=10,
- A=50, B=35, n=9,
- A=15, B=25, n=9.
and then explain what happens in general.
This project is extendable later, if you want to continue with it.