Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Milan Vojnovic

Milan Vojnovic is a senior researcher with Microsoft Research Cambridge. He is also an Affiliated Lecturer at the University of Cambridge with the Department of Pure Mathematics and Mathematical Statistics.

He received his Ph.D. in Communication Systems from EPFL, Switzerland, in 2003, and both M.Sc. and B.Sc. in Electrical Engineering from the University of Split, Croatia, in 1998 and 1995, respectively. He was a visiting researcher with Mathematics Research Center, Bell Laboratories, Murray Hill, New Jersey, in 2001.

His research interests are in the general space of algorithms, especially in the context of large-scale distributed systems and services, and incentives in online services. 

He received IEEE IWQoS 2007 Best Student Paper Award with Shao Liu and Dinan Gunawardena for a work on congestion control protocols, ACM SIGMETRICS 2005 Best Paper Award with Laurent Massoulie for a work on performance of peer-to-peer file sharing systems, IEEE INFOCOM 2005 Best Paper Award with Jean-Yves Le Boudec for a work on random mobility models, and ITC-17 2001 Best Student Paper Award with Jean-Yves Le Boudec for a work on equation-based congestion control. He was awarded the 2010 ACM SIGMETRICS Rising Star Researcher and the 2005 ERCIM Cor Baayen Award.


Contest Theory: Incentive Mechanisms and Ranking Methods 

Forthcoming January 2016, Cambridge University Press - book page

  • Used as lecture material for a Part III course at the University of Cambridge 

Professional Service

  • Organizer:
  • Steering Committee:
    • Workshop on Online Social Networks 2008-10 (co-located with ACM Sigcomm 2008-09, USENIX 2010)
    • NetEcon (co-located with IEEE Infocom 2012, ACM EC 2011, USENIX OSDI 2010, ACM EC 2009, ACM Sigcomm 2008), IBC 2006
    • WOSN 2010: the 3rd Workshop on Online Social Networks, co-located with USENIX, June 22, 2010
  • Technical Program Committee:
    • ACM PODS 2013 (external review committee for Cloud Computing and Next-Generation Distributed Query Processing), ACM WWW 2009-2012, ACM Sigmetrics 2011-2014, IEEE Infocom 2006-2012, ITC 2008-2012, ACM EC 2011, NetEcon 2009, NET-COOP 2008-2009, Spaswin 2011, Inter-Perf 2007, ACM Sigcomm 2007 

Some Talks

  • Utility Sharing and Social Welfare, Theory Workshop, Department of Economics, University of Cambridge, June 4th 2015; Seminar on Discrete Mathematics and Game Theory, London School of Economics, June 11th 2015. (pptx)
  • How to Divide Prize Money?, Invited Lecture to Trinity Mathematical Society, Cambridge, February 2nd, 2015. (pptx)

  • Crowdsourcing and All-Pay Auctions, Contemporary Economic Issues, University of East Anglia, Norwich, November 10, 2014 (pptx)

  • Consensus - a retrospective, Workshop on Performance and Control of Large-Scale Networks, Eurandom June-July 2014, Oxford University June 2014 (pptx)

  • Balanced Graph Partitioning for Massive Scale Computations, LIDS Seminar, MIT, also Warwick University, December 2013

  • Cooperation and Efficiency in Utility Maximization Games, Microsoft Research, Silicon Valley, Theory Seminar, October 2013 (pptx)
  • Efficiency and the Redistribution of Welfare, invited lecture at Hamilton Institute, Ireland, February 2013 (pptx)
  • Some Maths of use in the Computer Systems World, this was an overview talk to postgraduate students of Cambridge Centre of Analysis, University of Cambridge, October 2012 (pptx)
  • Consensus, Lecture Series Algorithms and Complexity in Durham, University of Durham, Durham, UK, October 2012 (pptx)
  • Sampling Based Range Partition Methods for Big Data Analytics + Some Extras, INQUEST Workshop, Oxford, UK, September 2012 (pptx)
  • Countinuous Count Tracking for Distributed Non-Monotonic Streams, NII Shonan Meeting: Large-Scale Distributed Computation, Shonan, Japan, and Tokyo Institute of Technology, January 2012 (pptx)
  • Mechanism Design, SURI (Summer Research Institute), EPFL, June 2011 (pptx)
  • Hop Limited Flooding over Dynamic Networks, Infocom 2011 (ppsx)
  • The Weighted Proportional Resource Allocation, Microsoft Research Asia, Beijing, Apr 2011; Centre for Mathematical Sciences, University of Cambridge, Networks (Operations Research) Talks, Oct 2010; Harvard University, Seminar to EconCS Group, Nov 3, 2009 (ppsx)
  • Barganing Dynamics in Exchange Networks, Allerton 2010 (ppt)
  • Computer Systems seen as Auctions, keynote talk, ACM Sigmetrics 2010, June 2010 (ppt)
  • Mechanism Design, Tutorial, Microsoft Research Cambridge, March 2010 (ppt)
  • Binary Interval Consensus, IEEE Infocom 2010 (ppt)
  • Optimal Channel Choice ..., IEEE Infocom 2010 (ppt)
  • Crowdsourcing and All-Pay Auctions, UC Berkeley, July 13, 2009; Statslab Networks Seminar, University of Cambridge, UK, May 2009 (ppt) (crowdsourcing project page)
  • Consensus with Limited Processing and Signalling, Statslab lecture series, University of Cambridge, UK, Oct 2008; Workshop on Epidemic Spreading and Networks, Imperial College London, UK, Oct 08; NET-COOP, Paris, France, Sept 08 (ppt)
  • Tagging done by YOU, MSR Cambridge Tutorial, shorter version presented at the Workshop on Mathematics of Communication Networks, ENS Paris, France, 07; INFORMS 07, Eindhoven, Netherlands (ppt)
  • Power Law and Exponential Decay - Mobile Devices, invited lecture, Hynet colloquium series, University of Maryland, USA, Mar 07 (pps)
  • On the Origins of Power Laws in Mobility Systems, Workshop on Clean Slate Network Design 06, Cambridge, UK (ppt)
  • Random Trip Mobility Models, Tutorial, ACM Mobicom 06, with Jean-Yves Le Boudec, Los Angeles, CA, USA (ppt
  • Reactive Patching, tutorial, Performance 05, with Ayalvadi Ganesh, Juan-le-Pins, France, Oct 05 (pps)
  • Farsighted Congestion Controllers, CSAIL, MIT, Nov 05 (ppt)
  • Farsighted Congestion Control, IEEE Infocom 05, Miami, Florida, USA (ppt)
  • Random Trip Models, IEEE Infocom 05, Miami, Florida, USA (ppt)
  • Coupon Replication Systems, ACM Sigmetrics 05, Banff, Canada (ppt)
  • The Random Trip Mobility Model, computer lab seminar, University of Cambridge, UK, Nov 04 (ppt)
  • Equation-based Rate Control: is it TCP-friendly?, ARC TCP Workshop, ENS Paris, Nov 03 (ppt)
  • On the Long-run Behavior of Equation-based Rate Control, ACM Sigcomm 02, Pittsburgh, PA, USA (ppt)
  • Some Observations on Equation-based Rate Control, ITC-17, Salvador da Bahia, Brazil, 01 (pdf)  

Selected Publications

Former Interns

  • Bo Zong, 2013, University of California at Santa Barbara
  • Nan Li, 2012/13, University of California at Santa Barbara
  • Charalampos Tsourakakis, 2012, CMU
  • Alan Roytman, 2012, UCLA
  • Zhengfeng Huang, 2012, Hong Kong University of Science and Technology
  • Zhenming Liu, 2011, Harvard University
  • Vasilis Syrgkanis, 2011, Cornell University
  • Jinshan Zhang, 2011, University of Liverpool, UK
  • Yu Wei, 2011, Stanford University
  • Amin Karabasi, 2010, EPFL
  • Thanh Nguyen, 2009, Cornell University, now a faculty at Purdue University
  • Dominic DiPalantino, 2008, Stanford University, now with Google
  • Elizeu Santos-Neto, 2008, University of British Columbia
  • Dinkar Vasudevan, 2008, EPFL, now with Icera, Bristol
  • Fabian Suchanek, 2007, MPI, now an assistant professor at MPI
  • James Cruise, 2007, University of Cambridge, now a faculty at the University of Edinburgh
  • Varun Gupta, 2006, CMU, now with University of Chicago business school
  • Thomas Karagiannis, 2006, UC Riverside, now with Microsoft Research
  • Shao Liu, 2005, UIUC, now with Microsoft


Microsoft Research Ltd
21 Station Road
Cambridge CB1 2FB
United Kingdom

Tel. +44 (0)1223 479 700
Fax. +44 (0)1223 479 999