Two sample negotiation problems from Nego Analysis.
1. Bidding for $1
A bill of one dollar is up for competitive sealed bidding. You are bidding for this $1 prize against N opponents chosen at random from this class. In the table below and on the computer, fill in your bid as a function of the number of opponents you face. Your strategy will be pitted against those of all other class members. Your raw score will be the average payoff from all these contests.
Your payoff for a winning bid b (in cents) is 100-b. Six rounds will be played, with the number of bidders varying as N=1, 2, 3, 5, 10, 25.
What would you bid for each round?
2. Vaxco-Dambit
In this bidding exercise, you will submit a sealed bid for a prize of uncertain value. It is equally likely that the value of the prize is $0, $10, or $20. There is one other bidder.
Lucky constructed a model (and yes, this is all the information that you are given), ran the numbers and believes that the best bid is $5. What do you think?
In a variation, assume that Dambit knows the value of the prize, and Vaxco does not. As Vaxco, what is your bid now? Lucky thinks it's $3.33, but really has no idea.
As Dambit, what bid do you submit when the prize is $0? $10? $20?
12:16:28 AM
|