Debt settlement optimization with transaction constraints in peer-to-peer payment networks
Bachelor thesis
Group activities often lead to shared expenses and complex webs of who owes whom. Furthermore, constraints like individual transaction limits or different repayment options of the peers impede the rebalancing of the debts. The objective of this thesis is to develop an optimization model by extending the classical transportation problem to this problem setting such that an optimal debt settlement plan (e.g., a plan with a minimal number of transactions, a plan with minimal transaction costs, …) is determined. To test computational performance, the model will then be implemented and solved with a standard solver.
Basic implementation skills in an object-oriented programming language are required for working on this topic.
Interested in this topic? Please read about the application procedure on our website!