In this talk, we first introduce a popular type of electronic exchange known as an electronic crossing network. We will then present online algorithms for trading in these exchanges by Kakade, Kearns, Mansour and Ortiz. Lastly, we will present some results of one of my ongoing research projects with Aaron Johnson. In particular, we show that a related optimization problem is NP-hard.