This paper examines transitions in sniping behavior among algorithmic traders, finding new profitable strategies.
problem Understanding transitions from sure to probabilistic sniping in competitive algorithmic trading environments.
method Reinterpretation and extension of Menkveld and Zoican's stylized game, analysis of repeated games, sequential statistical testing.
result Probabilistic sniping can be profitable in certain conditions, resembling the prisoner's dilemma.