Varsha Dani's Publications

Papers

  • Varsha Dani, Mahnush Movahedi and Jared Saia
    Scalable Mechanisms for Rational Secret Sharing: Working Draft
    (Full version of PODC 2011 paper below, but with some improvements and revisions.) Submitted as a brief announcement to PODC 2012

  • Varsha Dani, Mahnush Movahedi, Yamel Rodriguez, and Jared Saia
    Scalable Rational Secret Sharing
    Proc. 30th Annual ACM Symposium on the Principles of Distributed Computing (PODC 2011)

  • Varsha Dani and Cristopher Moore
    Independent Sets in Random Graphs from the Weighted Second Moment Method.
    Manuscript 2011, arXiv:1011.0180v1[cs.CC]

  • Peter Bartlett, Varsha Dani, Thomas Hayes, Sham Kakade, Alexander Rakhlin and Ambuj Tewari
    High Probability Regret Bounds for Online Linear Optimization
    Proc. 21st Annual Conference on Learning Theory (COLT 2008)

  • Varsha Dani, Thomas Hayes and Sham Kakade
    Stochastic Linear Optimization under Bandit Feedback
    Proc. 21st Annual Conference on Learning Theory (COLT 2008)

  • Varsha Dani, Thomas Hayes and Sham Kakade.
    The Price of Bandit Information for Online Linear Optimization
    Proc. 21st Annual Conference on Neural Information Processing Systems (NIPS 2007)}

  • Varsha Dani, Omid Madani, David Pennock, Sumit Sanghai and Brian Galebach.
    An empirical comparison of algorithms for aggregating expert predictions.
    In: Proc. 22nd Conference on Uncertainty in Artificial Intelligence, (UAI 2006).(paper currently unavailable)

  • Varsha Dani and Thomas Hayes
    Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary.
    In: Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), 937-943.

  • Alina Beygelzimer, Varsha Dani, Thomas Hayes, John Langford and Bianca Zadrozny
    Error Limiting Reductions Between Classification Tasks.
    In: Proc. 22nd International Conference on Machine Learning (ICML 2005)

  • Ivona Bezakova and Varsha Dani
    Allocating Indivisible Goods.
    University of Chicago Dept. of Comp. Sci. Technical Report TR-2004-10, December 2004.
    Survey of results invited for publication in ACM SIGecom Exchanges, Vol. 5.3, 2005.

Ph.D. Thesis

Algorithms for Bandit Online Linear Optimization
(submitted December 2007)
Advisor: Prof. Lance Fortnow

Reviews

Varsha Dani.
Review of "Fair Division and Collective Welfare by Herv\'e Moulin", MIT Press, 2003.
ACM SigACT News {\bf 37}(2) June 2006, 12--17.