24 citations · 25 across the 3 of their papers we have counts for
3 papers
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…
Maximizing Non-monotone Submodular Set Functions Subject to Different Constraints: Combined Algorithms
Salman Fadaei, MohammadAmin Fazli, MohammadAli Safari
We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approx…
Pure Nash Equilibria: Complete Characterization of Hard and Easy Graphical Games
Albert Xin Jiang, MohammadAli Safari
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special…