Michael Brautbar

 

Contact info:

Computer and Information Science

University of Pennsylvania

561 Levine Hall (GRW Wing), 3330 Walnut Street,

Philadelphia, PA 19104.

Email: brautbar AT cis DOT upenn DOT edu

 

Welcome! I'm a PhD student in the Computer and Information Science Department at the University of Pennsylvania.

My academic advisor is Michael Kearns.

Before coming to Penn, I completed my undergraduate and master of science studies in Computer Science from the Hebrew University of Jerusalem.

 

Research Interests:

·    Theory underlying social networks and social dynamics.

·    Economic theory of electronic commerce.

·    Theoretical foundations of big data analysis, particularly of social and economic data.

·    Applied probability.

 

Publications:

·    Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution. [arXiv]

        with Christian Borgs, Jennifer Chayes and Brendan Lucier

         In submission.

 

·    Heaven Can Wait: Mechanism Design with Intrinsic Utilities.

        with Christian Borgs, Jennifer Chayes, Hu Fu, Nick Gravin, Balu Sivan and Vasilis Syrgkanis

         In submission.

 

·    The Power of Local Information in Social Networks. [arXiv]

        with Christian Borgs, Jennifer Chayes, Sanjeev Khanna and Brendan Lucier

         Internet and Network Economics (WINE), 2012, Liverpool, UK.

 

·    A Sublinear Time Algorithm for PageRank Computations. [arXiv]

with Christian Borgs, Jennifer Chayes and Shang-Hua Teng

Algorithms and Models for the Web Graph (WAW), 2012, Halifax, NS.

Invited to special issue of Internet Mathematics Journal.

 

·    A Clustering Coefficient Network Formation Game. [PDF]

with Michael Kearns

Symposium on Algorithmic Game Theory (SAGT), 2011, Amalfi, Italy.

A preliminary workshop version appeared in the second Workshop on Information in Networks.

 

·    Private and Third Party Randomization in Risk-Sensitive Equilibrium Concepts. [PDF]

with Michael Kearns and Umar Syed

Twenty-Forth AAAI Conference on Artificial Intelligence (AAAI), 2010, Atlanta, Georgia.

 

·    Local Algorithms for Finding Interesting Individuals in Large Networks. [PDF]

with Michael Kearns

Innovations in Computer Science (ICS), 2010, Beijing, China.

A preliminary workshop version appeared in the first Workshop on Information in Networks

and also in New York Computer Science and Economics Day, 2009.

 

·    Online Learning a Binary Labeling of a Graph. [PDF]

Workshop on Mining and Learning with Graphs (MLG), 2009, Leuven, Belgium.

 

·    On Efficient Entropy Approximation via Lempel-Ziv Compression. [PDF]

with Alex Samorodnitsky

 

·    Approximating the Entropy from Sublinear Samples. [PDF]

with Alex Samorodnitsky

ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, New Orleans, USA.

 

·    Approximating the Entropy of Large Alphabets.

Master thesis, Hebrew University of Jerusalem.