Michal Feldman is an Associate Professor in the Blavatnik School of Computer Science at Tel Aviv University and a researcher at Microsoft research Israel. She received her Ph.D. from the University of California at Berkeley in 2005, and in 2007 she completed a postdoctoral term at the Hebrew University as a Lady Davis fellow. She was recruited by the Hebrew University of Jerusalem in 2007, where she was a faculty member in the School of Business Administration and the Center for the study of rationality until 2013. During 2011-2013, she held visiting positions at the Center for Research on Computation and Society at Harvard University and at Microsoft Research New England. She is an alumna of the Global Young Academy and a member of the Israeli Young Academy for Sciences and Humanities. Prof. Feldman’s research focuses on the intersection of computer science, game theory and microeconomics, an area often called "Algorithmic Game Theory". Her research has appeared in the leading journals and conferences in all of the above disciplines and has been widely cited. She has delivered plenary talks at prestigious international events, among them is the World Congress of Game Theory. She is the vice chair of ACM Special Interest Group on Electronic Commerce (SIGEcom), and serves on the editorial board of various journals, among them are the Journal of Computer and System Sciences (JCSS), ACM Transactions on Computation and Economics (TEAC), Mathematics of Operations Research (MOR) and Networks. She served as the Program Committee chair of the ACM Conference on Economics and Computation in 2015. She is the recipient of numerous grants and awards, among them are the Alon Fellowship for outstanding young researchers, the ERC (European Research Council) grant, the Marie Curie International Outgoing Fellowship, as well as ISF and Google grants. Homepage: https://www.cs.tau.ac.il/~mfeldman/
Selected publications Michal Feldman, Kevin Lai, Ion Stoica and John Chuang, “Robust Incentive Techniques for Peer-to-Peer Networks”, ACM Conference on Electronic Commerce (EC), pp. 102–111, 2004.
Nir Andelman, Michal Feldman and Yishay Mansour, “Strong Price of Anarchy”, Games and Economic Behavior, Vol. 65, no. 2, pp. 289–317, 2009; and Symposium on Discrete Algorithms (SODA) 2007.
Amir Epstein, Michal Feldman and Yishay Mansour, “Strong Equilibrium in Cost-Sharing Connection Games”, Games and Economic Behavior (GEB), Vol. 67, pp. 51–68, 2009; and ACM Conference on Electronic Commerce (EC), 2007, Best paper award
Moshe Babaioff, Michal Feldman, Noam Nisan and Eyal Winter, “Combinatorial Agency”. Journal of Economic Theory (JET), 147(3):999–1034, 2012; and ACM Conference on Electronic Commerce (EC), 2006.
Michal Feldman, Hu Fu, Nick Gravin and Brendan Lucier, "Simultaneous Auctions are (almost) Efficient". ACM Symposium on the Theory of Computing (STOC), 2013, and Games and Economic Behavior (GEB), Special Issue on STOC'13 (forthcoming).
Michal Feldman, Nick Gravin and Brendan Lucier, "Combinatorial Walrasian equilibrium", SIAM Journal on Computing (SICOMP), 45(1): 29-48 (2016), and ACM Symposium on the Theory of Computing (STOC) 2013.
Noga Alon, Michal Feldman, Ariel Procaccia and Moshe Tennenholtz, "Strategyproof Approximation of the minimax on Networks", Mathematics of Operations Research (MOR), Vol. 35(3), pages 513-526, 2010.