1. Mustafa Akgül . 1992. The Linear Assignment Problem . In Combinatorial Optimization, Mustafa Akgül, Horst W Hamacher, and Süleyman Tüfekçi (Eds.). Springer , 85--122. Mustafa Akgül. 1992. The Linear Assignment Problem. In Combinatorial Optimization, Mustafa Akgül, Horst W Hamacher, and Süleyman Tüfekçi (Eds.). Springer, 85--122.
2. LarryAusubel and Paul Milgrom . 2002. AscendingAuctions with Package Bidding. Frontiers of Theoretical Economics 1, 1 ( 2002 ), Article 1. LarryAusubel and Paul Milgrom. 2002. AscendingAuctions with Package Bidding. Frontiers of Theoretical Economics 1, 1 (2002), Article 1.
3. Carsten Baum , Ivan Damgård , and Claudio Orlandi . 2014 . Publicly Auditable Secure Multi-Party Computation. In SCN 2014 (LNCS), Michel Abdalla and Roberto De Prisco (Eds.) , Vol. 8642 . Springer, 175--196. Carsten Baum, Ivan Damgård, and Claudio Orlandi. 2014. Publicly Auditable Secure Multi-Party Computation. In SCN 2014 (LNCS), Michel Abdalla and Roberto De Prisco (Eds.), Vol. 8642. Springer, 175--196.
4. Dimitri P Bertsekas . 1979. A distributed algorithm for the assignment problem. Lab. for Information and Decision Systems Working Paper , MIT ( 1979 ). Dimitri P Bertsekas. 1979. A distributed algorithm for the assignment problem. Lab. for Information and Decision Systems Working Paper, MIT (1979).
5. Auction algorithms for network flow problems: A tutorial introduction