-
Chapter and Conference Paper
Almost Envy-Free Repeated Matching in Two-Sided Markets
A two-sided market consists of two sets of agents, each of whom have preferences over the other (Airbnb, Upwork, Lyft, Uber, etc.). We propose and analyze a repeated matching problem, where some set of matches...
-
Chapter and Conference Paper
Ad Allocation for Browse Sessions
A user’s session of information need often goes well beyond his search query and first click on the search result page and therefore is characterized by both search and browse activities on the web. In such se...
-
Chapter and Conference Paper
Enriching Education through Data Mining
Education is acknowledged to be the primary vehicle for improving the economic well-being of people [1,6]. Textbooks have a direct bearing on the quality of education imparted to the students as they are the p...
-
Chapter and Conference Paper
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with such graphs having billions of...
-
Chapter and Conference Paper
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms
This paper describes a technique for reducing the query-time cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of its immediate neighborhood (which is a...