#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2008

2017

- This year (2)
- Last 5 years (6)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We consider sequential <i>balls-into-bins</i> processes that randomly allocate <i>m</i> balls into <i>n</i> bins. We analyze two allocation schemes that achieve a close to optimal maximum load of ⌈<i>m</i>/<i>n</i>⌉ + 1 and require only <i>O(m)</i> (expected) allocation time. These parameters should be compared with the classic… (More)

We consider the problem of fair allocation of indivisible goods where we are given a set I of m indivisible resources (items) and a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value v j > 0 for a subset of customers interested in j and it has no value for other customers. The goal is to find a feasible… (More)

Selfish behavior of nodes of a network such as sensors of a geographically distributed sensor network, each of which owned and operated by a different stakeholder may lead to a game theoretic setting called " selfish routing ". The fact that every node strictly aims at maximizing its own utility can cause degradations of social welfare. An issue of concern… (More)

Clustering problems are well-studied in a variety of fields such as data science, operations research, and computer science. Such problems include variants of centre location problems, k-median, and k-means to name a few. In some cases, not all data points need to be clustered; some may be discarded for various reasons. For instance, some points may arise… (More)

- Zachary Friggstad, Arnoosh Golestanian, +5 authors Yifeng Zhang
- APPROX-RANDOM
- 2017

- Kamyar Khodamoradi, Ramesh Krishnamurti
- ICORES
- 2016

We study a novel variation of network creation games in which the players (vertices) form a graph by building undirected edges to each other with the goal of reducing their costs of using the network. The model we introduce assumes that a minimal set of nodes with high reachability from others are handed the responsibility of routing the traffic alongside… (More)

We consider the problem of allocating a set I of m indivisible resources (items) to a set P of n customers (players) competing for the resources. Each resource j ∈ I has a same value vj > 0 for a subset of customers interested in j, and zero value for the remaining customers. The utility received by each customer is the sum of the values of the resources… (More)

- ‹
- 1
- ›