CRCS Affiliate Scott Kominers will be teaching Economics 2099, Market Design, at Harvard University in fall 2015.
Course Description: This course explores the theory and practice of market design. Key topics include auctions, labor market matching, school choice programs, online markets, organ exchange systems, financial market design, and matching with contracts. The first half of the course will introduce market design and its technology; subsequent weeks will discuss recent papers alongside their classical antecedents. Read more about CRCS Affiliate Scott Kominers to Instruct Market Design
Fellow Babis Tsourakakis has a paper accepted in the ACM Transactions on Knowledge Discovery from Data (TKDD). The Transactions on Knowledge Discovery from Data (TKDD) is part of the family of journals produced by the ACM. TKDD publishes one volume yearly. Each volume is comprised of four issues, which appear in March, June, September and December.
Babis Tsourakakis received an invitation to give a talk at the International Symposium on Optimization (ISMP). ISMP has invited top academics and industrial users of mathematical optimization to convene in Pittsburgh to discuss recent advances and important challenges from both theory and practice.
Videos from the symposium "Privacy in a Networked World," which the Privacy Tools Project served as the Symposium Planning Committee, may be accessed on the IACS youtube channel. The videos feature all speakers from the symposium, including the conversation between Bruce Schneier and Edward Snowden.
CRCS Fellow Babis Tsourakakis had a paper accepted in the 47th Symposium of Theory of Computing (STOC 2015), where he will present it in June. The main contribution of the paper is a novel algorithmic framework for large-scale dynamic graphs that is at the same time both space- and time-efficient. This paper is part of a broader project he is conducting on scalable graph mining algorithms.
CRCS Fellow Babis Tsourakakis had two single-author papers accepted at WWW 2015, the premiere venue on the World Wide Web. This year, there were 929 paper submissions and 131 paper acceptances. Both papers will be presented on the track "Social Networks and Graph Analysis".
The first paper is titled as "Provably Fast Inference of Latent Features from Networks" and the second paper as "The k-clique Densest Subgraph Problem".