In this section, we define a restriction of anonymous hedonic games that we call neutrally anonymous hedonic games. We show that such games are subset-neutral, and hence existence of a Nash stable partition and an individually stable partition is gu…

We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the c…

In this paper, we provided the first general results on the fairness concept of envy-freeness up to any good. Our most technically involved result was an exponential lower bound on the number of queries required by any deterministic algorithm to fin…

The goal of fair division is to distribute resources among competing players in a "fair" way. Envy-freeness is the most extensively studied fairness …

Mobile health applications, including those that track activities such as exercise, sleep, and diet, are becoming widely used. Accurately predicting …

In healthcare applications, temporal variables that encode movement, health status and longitudinal patient evolution are often accompanied by rich s…

Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small s…

False information can be created and spread easily through the web and social media platforms, resulting in widespread real-world impact. Characteriz…

The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph $G$ such that we may support insertions and deletions of edg…

Assessing uncertainty is an important step towards ensuring the safety and reliability of machine learning systems. Existing uncertainty estimation t…

Recent progress in style transfer on images has focused on improving the quality of stylized images and speed of methods. However, real-time methods …

Our work shows that graphs cannot be compressed into O(n4/3−ε) bits while maintaining distances within a constant (or even subpolynomial) additive error. We thus implicitly show that the 4/3 exponent is tight for additive spanners and emulators, and…

A spanner is a sparse subgraph that approximately preserves the pairwise distances of the original graph. It is well known that there is a smooth tra…

Randomized algorithms for very large matrix problems have received a great deal of attention in recent years. Much of this work was motivated by prob…

Unsupervised image-to-image translation aims at learning a mapping between two visual domains. However, learning a translation across large geometry …

We propose an online convex optimization algorithm (RescaledExp) that achieves optimal regret in the unconstrained setting without prior knowledge of…

Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to ide…

Our goal is to deploy a high-accuracy system starting with zero training examples. We consider an "on-the-job" setting, where as inputs arrive, we us…

We introduce Fonduer, a knowledge base construction (KBC) framework for richly formatted information extraction (RFIE), where entity relations and at…

We propose generalized random forests, a method for non-parametric statistical estimation based on random forests (Breiman, 2001) that can be used to…

Probabilistic survival predictions from models trained with Maximum Likelihood Estimation (MLE) can have high, and sometimes unacceptably high varian…

Measuring the distances between vertices on graphs is one of the most fundamental components in network analysis. Since finding shortest paths requir…

We introduce MURA, a large dataset of musculoskeletal radiographs containing 40,895 images from 14,982 studies, where each study is manually labeled …

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account