Yuqui Ian Yang: A decentralized sparse fare splitting algorithm

A fare splitting algorithm that is guaranteed to remove all redundant transactions is proposed. We proved the equivalence of the non-existence of redundant transactions and the minimization of the total transaction amount in the system. We also showed that although the resulting transaction amount is unique, the final transaction graph is not. By selecting a basic feasible solution, however, we can achieve a sparse solution.