Abstract: Polynomials are the most fundamental mathematical objects in algebra and it is compelling to understand the complexity of computing polynomials. That is, given a polynomial we want to understand the number of arithmetic

Abstract: Social systems are now fueled by algorithms that facilitate and control connections and information. Simultaneously, computational systems are now fueled by people -- their interactions, data, and behavior.

Absract:  Network Utility Maximization has been studied for resource allocation problems in communication networks for nearly two decades.

Abstract: We consider testing and learning problems on causal Bayesian networks as defined by Pearl.  Given a causal Bayesian network M on a graph with  n discrete variables and bounded in-degree and bounded ``confounded  components'', we show tha

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