Abstract: The submodular welfare maximization problem (SWM) captures an important subclass of combinatorial auctions and has been extensively studied in various settings.

In this presentation, we adapt mathematical tools and models from Telecommunication Networks to Online Social networks.

In this talk, we describe a new type of probabilistic algorithm (introduced by Gat and Goldwasser [GG11]) called Pseudo-deterministic Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time and to produce a correc

Abstract: Markov Decision Problems (MDPs) are a well-studied abstraction of sequential decision making. Policy Iteration (PI) is a classical, widely-used family of algorithms to compute an optimal policy for a given MDP.

We will prove the following theorem which gives an alternate proof to the Erdős-Hanani conjecture.