term 2 - deterministic contests - technical introduction Flashcards
1
Q
what are deterministic contests?
A
there is no noise in the bidding process. CSF takes the form of highest bidder wins?
2
Q
what is the explicit form of CSF for a deterministic contest?
A
3
Q
what is the first proposition for deterministic contests?
A
4
Q
what is the method of proof for which the first proposition of deterministic contests is proven>
A
they use a proof of contradiction. they use this twice: one for symmetric pure nash equilibrium and the other for asymmetric nash equilibrium
5
Q
what is the proof for no symmetric pure strategy nash equillibrium?
A
6
Q
what is the proof for no assymetric pure strategy nash equillibrium?
A
7
Q
A
