Michael (Mickey) 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

Mobile: 215-779-7935

 

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

My academic advisor is Michael Kearns.

 

Research Interests

  • Large social and information networks: modeling, algorithms, and analysis.
  • The interface of algorithms, game theory, and economics.
  • Algorithm design.

 

Papers

  • A Sublinear Time Algorithm for PageRank Computations and Related Applications

with Christian Borgs, Jennifer Chayes, and Shang-Hua Teng

In Submission.

  • The Power of Local Information in Social Networks

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

In Submission.

  • 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 (WIN).

  • 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 (WIN)

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

  • Online Learning a Binary Labeling of a Graph [PDF]

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.

TA-ing

  • CIS 160: Mathematical Foundations of Computer Science (Fall 2009, Fall 2010)
  • CIS 112: Networked Life (Spring 2010)