Share This Author
Influence and correlation in social networks
- A. Anagnostopoulos, Ravi Kumar, Mohammad Mahdian
- Computer ScienceKnowledge Discovery and Data Mining
- 24 August 2008
Two simple tests are proposed that can identify influence as a source of social correlation when the time series of user actions is available and are applied to real tagging data on Flickr, exhibiting that while there is significant social correlation in tagging behavior on this system, this correlation cannot be attributed to social influence.
A new greedy approach for facility location problems
A simple and natural greedy algorithm for the metric uncapacitated facility location problem achieving an approximation guarantee of 1.61 and proving a lower bound of 1+2/e on the approximability of the k-median problem.
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
The method of dual fitting and the idea of factor-revealing LP are formalized and used to design and analyze two greedy algorithms for the metric uncapacitated facility location problem.
Approximation Algorithms for Metric Facility Location Problems
- Mohammad Mahdian, Y. Ye, Jiawei Zhang
- Computer Science, BusinessSIAM journal on computing (Print)
- 1 August 2006
This paper presents a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a soft-capacitate facility location algorithm that achieves the integrality gap of the standard linear programming relaxation of the problem.
Improved Approximation Algorithms for Metric Facility Location Problems
This algorithm uses an idea of cost scaling, a greedy algorithm of Jain, Mahdian and Saberi, and a greedy augmentation procedure of Charikar, Guha and Khuller to solve the uncapacitated metric facility location problem.
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
This paper studies the ranking algorithm in the random arrivals model, and shows that it has a competitive ratio of at least 0.696, beating the 1-1/e ≈ 0.632 barrier in the adversarial model.
Packing Steiner trees
- K. Jain, Mohammad Mahdian, M. Salavatipour
- Mathematics, Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 12 January 2003
An algorithm with an asymptotic approximation factor of |S|/4 gives a sufficient condition for the existence of k edge-disjoint Steiner trees in a graph in terms of the edge-connectivity of the graph.
A Cascade Model for Externalities in Sponsored Search
- D. Kempe, Mohammad Mahdian
- Computer ScienceWorkshop on Internet and Network Economics
- 17 December 2008
This paper proposes and analyzes a model for externalities in sponsored search ads, based on the assumption that users will visually scan the list of ads from the top to the bottom, and presents a polynomial-time incentive-compatible auction mechanism for allocating and pricing ad slots.
Marriage, honesty, and stability
It is shown that the game with complete information has an equilibrium in which a (1 - o(1)) fraction of the strategies are truthful in expectation, and in the more realistic setting of a game of incomplete information, the set of truthful strategies form a ( 1 + o (1)-approximate Bayesian-Nash equilibrium.
Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games
- L. Fleischer, K. Jain, Mohammad Mahdian
- Computer Science, Economics45th Annual IEEE Symposium on Foundations of…
- 17 October 2004
It is shown that tolls exist to induce the Nash equilibrium of general nonatomic congestion games to be system optimal, and an exponential bound on tolls is given that is independent of the number of network users and theNumber of commodities.