196 citations · 319 across the 19 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
cs.GT2011★ 24 cited
On a Bounded Budget Network Creation Game
Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli +4
We consider a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In our model, each link has unit price and each agent trie…
math.CO2011★ 4 cited
On the density of nearly regular graphs with a good edge-labelling
Abbas Mehrabian
A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path fro…
math.CO2011
Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs
Abbas Mehrabian
We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass throu…