Liad Blumrosen
POST DOC RESEARCHER
.
I am now a faculty at the economics department of the Hebrew University. I can be reached at <my-last-name>@huji.ac.il.
I am a Post-doc at Microsoft Research, Silicon Valley (2006-2009).
Research Interests:
- Computational economics. Electronic commerce. Algorithmic mechanism design.
- Microeconomic theory.Game Theory. Auction theory. Social choice.
- Online advertising. Sponsored-search auctions. Structure, externalities and dynamics in social systems.
Education:
- PhD in computer science, The Hebrew University, 2006.
Advisor: Noam Nisan.
Title:”Information and Communication in Mechanism Design”. - B.Sc. (The Hebrew University) in Computer Science, Economics and
“Amirim” special honors program in natural sciences.
Academic service:
Publications
- Liad Blumrosen, Aaron Roth, and Moshe Babaioff, Auctions with Online Supply, in Fifth Workshop on Ad Auctions, July 2009
- Liad Blumrosen, Computationally-Feasible Auctions for Convex Bundles, in Games and Economic Behavior, vol. 63, no. 2, pp. 588–620, 2008
- Liad Blumrosen and Thomas Holenstein, Posted prices vs. negotiations: an asymptotic analysis, in EC '08: Proceedings of the 9th ACM conference on Electronic commerce, 2008
- Moshe Babaioff, Liad Blumrosen, Moni Naor, and Michael Schapira, Informational overhead of incentive compatibility, in EC '08: Proceedings of the 9th ACM conference on Electronic commerce, 2008
- Liad Blumrosen and Noam Nisan, Combinatorial Auctions, in Algorithmic Game Theory, Cambridge University Press, September 2007
- Liad Blumrosen, Implementing the Maximum of Monotone Algorithms, in 22nd Conference on Artificial Intelligence (AAAI), Vancouver, British Columbia, Canada, July 2007
- Liad Blumrosen, Noam Nisan, and Ilya Segal, Auctions with Severely Bounded Communications, in Journal of Artificial Intelligence Research, vol. 28, pp. 233-266, 2007
- Liad Blumrosen and Shahar Dobzinski, Welfare maximization in congestion games, in IEEE Journal on Selected Areas in Communications (JSAC), 2007
- Liad Blumrosen and Shahar Dobzinski, Welfare maximization in congestion games, in Proceedings of the 7th ACM conference on Electronic commerce, 2006
- liad blumrosen, Information and Communication in Mechanism Design, 2006
- Liad Blumrosen and Michal Feldman, Implementation with a bounded action space, in Proceedings of the 7th ACM conference on Electronic commerce, 2006
- Liad Blumrosen and Noam Nisan, On the computational power of iterative auctions, in The sixth ACM Conference on Electronic Commerce, 2005
- Liad Blumrosen and Noam Nisan, On the computational power of demand queries, in Siam Journal on Computing, to appear. An extended abstract in EC'05 contained preliminary results. Preliminary version appeared as Discussion paper no. 381, The Center for the Study of Rationality, The Hebrew University., 2005
- Liad Blumrosen and Noam Nisan, Informational Limitations of Ascending Combinatorial Auctions., in Working paper. An extended abstract in EC'05 contained preliminary results. Preliminary version appeared as Discussion paper no. 382, The Center for the Study of Rationality, The Hebrew University., 2005
- Moshe Babaioff and Liad Blumrosen, Computationally-Feasible Auctions for Convex Bundles, in 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). LNCS Vol. 3122., 2004
- Liad Blumrosen, Noam Nisan, and Ilya Segal, Multi-Player and Multi-Round Auctions with Severely Bounded Communication, pp. 102–113, 2003
- Liad Blumrosen and Noam Nisan, Auctions with Severely Bounded Communications, in The 43th Annual Symposium on Foundations of Computer Science (FOCS'02), 2002
- Levy L., Blumrosen L., and Nisan N., Online Markets for Distributed Market Services: the MAJIC system, in USITS 01, 2001
Contact details:
Liad Blumrosen
E-mail: <my-last-name>@huji.ac.il
