#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Payam Delgosha, Salman Beigi
- ArXiv
- 2013

Local state transformation is the problem of transforming an arbitrary number of copies of a bipartite resource state to a bipartite target state under local operations. That is, given two bipartite states, is it possible to transform an arbitrary number of copies of one of them to one copy of the other state under local operations only? This problem is a… (More)

This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects, when we can only use a comparison oracle. The comparison oracle, given two reference objects and a query object, returns the reference object most similar to the query object. The main problem we study is how… (More)

- Payam Delgosha, Venkat Anantharam
- 2017 IEEE International Symposium on Information…
- 2017

Consider a data source comprised of a graph with marks on its edges and vertices. Examples of such data sources are social networks, biological data, web graphs, etc. Our goal is to design schemes that can efficiently compress and store such data. We aim for universal compression, i.e. without making assumptions about the stochastic properties of the data.… (More)

- Payam Delgosha, Amin Aminzadeh Gohari
- 2012 IEEE Information Theory Workshop
- 2012

Cutting a cake is a metaphor for the problem of dividing a resource (cake) among several agents. The problem becomes non-trivial when the agents have different valuations for different parts of the cake (i.e. one agent may like chocolate while the other may like cream). A fair division of the cake is one that takes into account the individual valuations of… (More)

- Payam Delgosha, Amin Aminzadeh Gohari, Mohammad Akbarpour
- 2016 IEEE International Symposium on Information…
- 2016

We introduce a “high probability” framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high probability counterpart of the classical result of Mertens and Zamir for the zero-sum repeated games. Any… (More)

Consider a simple locally finite hypergraph on a countable vertex set, where each edge represents one unit of load which should be distributed among the vertices defining the edge. An allocation of load is called balanced if load cannot be moved from a vertex to another that is carrying less load. We analyze the properties of balanced allocations of load.… (More)

- ‹
- 1
- ›