Abstract
In this paper, we prove the existence of pure strategy Nash Equilibrium for 2-contestant Colonel Blotto games with asymmetric values, Tullock contest success functions with r <= 1, asymmetric lobbying effectiveness and use-it-or-lose-it budgets. We show that the solution to the pure strategy Nash Equilibrium can be equivalent to the problem of solving the roots of an equation. We give the lower bound and the upper bound of these roots. We also give some sufficient conditions, with which the uniqueness of pure strategy Nash Equilibrium can be proved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.