Liad Blumrosen is a faculty member in the Data Science Department at the Hebrew University Business School and a member of the Federmann Center for the Study of Rationality.
Prof. Blumrosen’s research focuses on Algorithmic Game Theory, Auction Design, Internet Economics, Electronic Commerce, and Industrial Organization.
Prof. Blumrosen earned his Ph.D. in computer science from the Hebrew University under the supervision of Prof. Noam Nisan; and a B.Sc. in computer science, economics, and the Amirim honors program from the Hebrew University. Prof. Blumrosen spent three years at Microsoft Research Silicon Valley before joining the Hebrew University.
His research has been published in various periodicals, including Games and Economic Behavior (GEB), Journal of Economic Theory (JET), Siam Journal on Computing (SICOMP), Transactions on Economics and Computation (TEAC), and Journal of Artificial Intelligence Research (JAIR). His work has also been presented at computer science conferences such asACM-EC, WINE, FOCS, AAAI, ICALP, APPROX, ITCS, and more.
He teaches the courses Electronic Commerce and Advertising, Auctions Theory and Practice, Competition and Market Structure, and Business Data and Technology.
- Research Summary
-
Liad’s research focuses on topics that border computer science, game theory, and business administration. In his work, Liad analyzes complex economic systems and extends guarantees on their performance under self-interested agents. Auction design is a prominent example of such an environment: Its rules are set in advance and the participants choose their strategies for their personal benefit. Such environments are explored in Liad’s work from theoretical and practical perspectives. Other related research interests are online advertising, competition and market structure, and internet economics.
- Publications
-
Book chapters and journals:
(Almost) Efficient Mechanisms for Bilateral Trading, by Liad Blumrosen and Shahar Dobzinski. Games and Economic Behavior (GEB). To appear.
Posting Prices with Unknown Distributions, by Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi and Yaron Singer. Transactions on Economics and Computation (TEAC), 5(2), Article 13 (2017). [pdf]
Auctions with Online Supply, by Moshe Babaioff, Liad Blumrosen and Aaron Roth.
Games and Economic Behavior (GEB), 90: 227-246 (2015). [pdf]Mechanism Design with a Restricted Action Space, by Liad Blumrosen and Michal Feldman. Games and Economic Behavior (GEB), 82, 424-443 (2013). [pdf]
The Communication Burden of Price Determination, by Moshe Babaioff, Liad Blumrosen and Michael Schapira (2008). Games and Economic Behavior (GEB), 77(1), 153-167 (2013). [pdf]
Informational Limitations of Ascending Combinatorial Auctions, by Liad Blumrosen and Noam Nisan. Journal of Economic Theory (JET), 145(3), 1203-1223 (2010). [pdf]
On the Computational Power of Demand Queries, by Liad Blumrosen and Noam Nisan.
Siam Journal on Computing (SICOMP), 39(4), 1372-1391 (2009). [pdf]Combinatorial Auctions, by Liad Blumrosen and Noam Nisan. Chapter 11 in the book "Algorithmic Game Theory". Editors: Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani. Cambridge University Press, 2007. [pdf]
Welfare Maximization in Congestion Games, by Liad Blumrosen and Shahar Dobzinski.
IEEE Journal on Selected Areas in Communications (JSAC), special issue: Non-Cooperative Behavior in Networking. 25(6):1224-1236. [pdf]Computationally-Feasible Truthful Auctions for Convex Bundles, by Moshe Babaioff and Liad Blumrosen. Games and Economic Behavior (GEB), 63(2): 588-620 (2008). [pdf]
Auctions with Severely Bounded Communication, by Liad Blumrosen, Noam Nisan and Ilya Segal. Journal of Artificial Intelligence Research (JAIR), 28:233-266 (2007) [pdf]
"Information and Communication in Mechanism Design”, Liad Blumrosen, PhD thesis, The Hebrew University (2006) Committee: Noam Nisan (advisor), Daniel Lehmann and Motty Perry. [pdf]
Peer-Reviewed Conferences:
Selling Complementary Goods: Dynamics, Efficiency and Revenue by Moshe Babaioff, Liad Blumrosen and Noam Nisan.
The 44th International Colloquium on Automata, Languages and Programming (ICALP 2017). [pdf] [full version]Approximating Gains-from-Trade in Bilateral Trading, by Liad Blumrosen and Yehonatan Mizrahi.
The 12th Conference on Web and Internet Economics (WINE 16). [pdf] [full version]Networks of Complements, by Moshe Babaioff, Liad Blumrosen and Noam Nisan.
The 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016). [pdf] [full version]Multilateral Deferred Acceptance Mechanisms, by Liad Blumrosen and Osnat Zohar.
The 11th Conference on Web and Internet Economics (WINE 15). [pdf] [full version]Reallocation Mechanisms, by Liad Blumrosen and Shahar Dobzinski.
The 15th ACM Conference on Economics and Computation (EC 14). [pdf]Only Valuable Experts Can be Valued, by Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert and Omer Reingold.
The 12th ACM Conference on Electronic Commerce (EC 11). [pdf]Posting Prices with Unknown Distributions, by Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi and Yaron Singer.
Innovations in Computer Science (ICS 2011). [pdf]Auctions with Online Supply, by Moshe Babaioff, Liad Blumrosen and Aaron Roth (2010).
The11th ACM Conference on Electronic Commerce (EC 10). Presented in the 5th workshop on ad auction, Stanford 2009. [pdf]Informational Overhead of Incentive Compatibility, by Moshe Babaioff, Liad Blumrosen, Moni Naor and Michael Schapira.
The 9th ACM Conference on Electronic Commerce (EC’08). [pdf]Posted prices vs. Negotiation: an asymptotic analysis, by Liad Blumrosen and Thomas Holenstein (2007).
The 9th ACM Conference on Electronic Commerce (EC’08).[pdf]Conversion Rates in Sponsored Search Auctions, by Liad Blumrosen, Jason Hartline and Shuzhen Nong (2007).
The 4th workshop on ad auctions (2008) (no published proceedings). [pdf]Implementing the Maximum of Monotone Algorithms, by Liad Blumrosen.
The 22nd Conference on Artificial Intelligence (AAAI'07). Short paper appeared in (AAMAS'07). [pdf]Implementation with a Bounded Action Space, by Liad Blumrosen and Michal Feldman.
The 7th ACM Conference on Electronic Commerce (EC'06). Proceeding version [pdf]Welfare Maximization in Congestion Games, by Liad Blumrosen and Shahar Dobzinski.
The 7th ACM Conference on Electronic Commerce (EC'06). [pdf]On the Computational Power of Iterative Auctions I: Demand Queries, by Liad Blumrosen and Noam Nisan.
The sixth ACM Conference on Electronic Commerce (EC'05).
An extended abstract contained parts I and II (both were accepted). [pdf]
Full paper (discussion paper no. 381, center of rationality, The Hebrew University):[pdf]On the Computational Power of Iterative Auctions II: Ascending Auctions, by Liad Blumrosen and Noam Nisan.
The sixth ACM Conference on Electronic Commerce (EC'05)
Full paper (discussion paper no. 382, center of rationality, The Hebrew University):[pdf]Computationally Feasible Auctions for Convex Bundles, by Moshe Babaioff and Liad Blumrosen.
The 7th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX+RANDOM'04). [pdf]Multi-Player and Multi-Round Auctions with Severely Bounded Communication, by Liad Blumrosen, Noam Nisan and Ilya Segal.
The 11th Annual European Symposium on Algorithms (ESA'03). [pdf]Auctions with Severely Bounded Communication, by Liad Blumrosen and Noam Nisan.
The 43th Annual Symposium on Foundations of Computer Science (FOCS'02) [pdf]