The Complexity of Tullock Contests DOI Creative Commons
Feng Shu,

Fan Yao,

Yang Yu

et al.

Published: Dec. 18, 2024

This paper studies the algorithmic complexity for computing pure Nash Equilibrium (PNE) in Tullock Contests. The (possibly heterogeneous) elasticity parameter \(r_i\) determines whether a contestant \(i\)’s cost function is convex, concave or neither. Our core finding that domains of governs solving contents. - When no contestant’s lies between \((1,2]\), we can design an efficient algorithm to compute NE; many values fall within prove determining NE existence not be solved polynomial time, assuming Exponential Time Hypothesis (ETH); Fully Polynomial-Time Approximation Scheme (FPTAS) find \(\epsilon\)-PNE when exact PNE exists. All our algorithms are efficiently implemented large-scale instances, and computational experiments demonstrate their effectiveness even complex scenarios.

Language: Английский

The Complexity of Tullock Contests DOI Creative Commons
Feng Shu,

Fan Yao,

Yang Yu

et al.

Published: Dec. 18, 2024

This paper studies the algorithmic complexity for computing pure Nash Equilibrium (PNE) in Tullock Contests. The (possibly heterogeneous) elasticity parameter \(r_i\) determines whether a contestant \(i\)’s cost function is convex, concave or neither. Our core finding that domains of governs solving contents. - When no contestant’s lies between \((1,2]\), we can design an efficient algorithm to compute NE; many values fall within prove determining NE existence not be solved polynomial time, assuming Exponential Time Hypothesis (ETH); Fully Polynomial-Time Approximation Scheme (FPTAS) find \(\epsilon\)-PNE when exact PNE exists. All our algorithms are efficiently implemented large-scale instances, and computational experiments demonstrate their effectiveness even complex scenarios.

Language: Английский

Citations

0