The Price of Anarchy in Cooperative Network Creation Games (2009)
Demaine, Erik D., Hajiaghayi, Mohammadtaghi, Mahini, Hamid, Zadimoghaddam, Morteza
In general, the games are played on a host graph, where each node is a selfish independent agent (player) and each edge has a fixed link creation cost \alpha. Together the agents create a network (a...
The Price of Anarchy in Cooperative Network Creation Games (2009)
Demaine, Erik D., Hajiaghayi, Mohammadtaghi, Mahini, Hamid, Zadimoghaddam, Morteza
In general, the games are played on a host graph, where each node is a selfish independent agent (player) and each edge has a fixed link creation cost α. Together the agents create a...
The Price of Anarchy in Cooperative Network Creation Games (2009)
Demaine, Erik D., Hajiaghayi, Mohammadtaghi, Mahini, Hamid, Zadimoghaddam, Morteza
In general, the games are played on a host graph, where each node is a selfish independent agent (player) and each edge has a fixed link creation cost α. Together the agents create a...
The Price of Anarchy in Cooperative Network Creation Games (2009)
Demaine, Erik D., Hajiaghayi, MohammadTaghi, Mahini, Hamid, Zadimoghaddam, Morteza
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the network design and...
Abstract Minimizing Movement (2008)
Erik D. Demaine, Mohammadtaghi Hajiaghayi, Hamid Mahini, Shayan Oveisgharan, Morteza Zadimoghaddam
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects...
Spanning trees with minimum weighted degrees (2008)
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Morteza Zadimoghaddam
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree), the weighted degree...
Erik D. Demaine, Mohammadtaghi Hajiaghayi, Hamid Mahini, Shayan Oveisgharan, Morteza Zadimoghaddam
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects...
Erik D. Demaine, Mohammad Ghodsi, Mohammadtaghi Hajiaghayi, Morteza Zadimoghaddam
This paper considers scheduling tasks while minimizing the power consumption of one or more processors, each of which can go to sleep at a fixed cost α. There are two natural versions of this...
Abstract Minimizing Movement (2008)
Erik D. Demaine, Mohammadtaghi Hajiaghayi, Hamid Mahini, Shayan Oveisgharan, Morteza Zadimoghaddam
We give approximation algorithms and inapproximability results for a class of movement problems. In general, these problems involve planning the coordinated motion of a large collection of objects...