1. Add unit testing for crazier things like random invertible matrices.

2. Copy the intro from my thesis into README.rst, and add a section
   explaining the CVXOPT formulation.

3. Try to eliminate the code in matrices.py.

4. Make it work on a cartesian product of cones in the correct order.

5. Make it work on a cartesian product of cones in the wrong order
   (apply a perm utation before/after).

6. Rename all of my variables so that they don't conflict with CVXOPT.
   Maybe x -> xi and y -> gamma in my paper, if that works out.

7. Make sure we have the dimensions of the PSD cone correct.

8. Come up with a fast heuristic (like making nu huge and taking e1 as
   our point) that finds a primal feasible point.

9. We only need to include the API docs for dunshire.games in the
   "user manual;" everything else can go in an appendix.

10. Check value of dual Lyapunov game, and test over the ice creams.