#### Filter Results:

#### Publication Year

2005

2006

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ara Hayrapetyan, Éva Tardos, Tom Wexler
- Distributed Computing
- 2005

The success of the Internet is remarkable in light of the decentralized manner in which it is designed and operated. Unlike small scale networks, the Internet is built and controlled by a large number of disperate service providers who are not interested in any global optimization. Instead, providers simply seek to maximize their own profit by charging… (More)

- Ara Hayrapetyan, Éva Tardos, Tom Wexler
- STOC
- 2006

In this paper we initiate the study of how collusion alters the quality of solutions obtained in competitive games. The price of anarchy aims to measure the cost of the lack of coordination by comparing the quality of a Nash equilibrium to that of a centrally designed optimal solution. This notion assumes that players act not only selfishly, but also… (More)

- Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos
- SODA
- 2005

We define a new class of network design problems motivated by designing information networks. In our model, the cost of transporting flow for a set of users (or servicing them by a facility) depends on the amount of <i>information</i> requested by the set of users. We assume that the aggregation cost follows economies of scale, that is, the incremental cost… (More)

- Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina
- ESA
- 2005

We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of nodes on the source side, subject to the constraint that its capacity not exceed a prescribed bound B. Besides being of interest in the study of graph cuts, this problem arises in many… (More)

- Rakesh M. Verma, Ara Hayrapetyan
- ACM Trans. Comput. Log.
- 2005

Programming language interpreters, proving equations (e.g. <i>x</i><sup>3</sup> = <i>x</i> implies the ring is Abelian), abstract data types, program transformation and optimization, and even computation itself (e.g., turing machine) can all be specified by a set of rules, called a rewrite system. Two fundamental properties of a rewrite system are the… (More)

Programming language interpreters, proving equations e.g. x 3 = x implies the ring is Abelian, abstract data types, program transformation and optimization, and even computation itself e.g., turing machine can all be speciied by a set of rules, called a rewrite system. A fundamental property of a rewrite system is the connuence or Church-Rosser property. In… (More)

- Aleksandrs Slivkins, Elliot Anshelevich, +9 authors Chaitanya Swamy
- 2006

Concurrent with numerous theoretical results on metric embeddings, a growing body of research in the networking community has studied the distance matrix defined by node-to-node latencies in the Internet, resulting in a number of recent approaches that approximately embed this distance matrix into low-dimensional Euclidean space. A fundamental distinction… (More)

- ‹
- 1
- ›