#### Filter Results:

- Full text PDF available (144)

#### Publication Year

1985

2017

- This year (10)
- Last 5 years (84)
- Last 10 years (137)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Y. Narahari, Dinesh Garg, Ramasuri Narayanam, V. Hastagiri Prakash
- Advanced Information and Knowledge Processing
- 2009

Mechanism Design is the art and science of designing rules of a game to achieve a specific outcome; mechanism design is the reverse engineering of games. It has been successfully applied to a variety of high impact problems in Internet and network economics: Internet advertising, spectrum auctions, electronic procurement, logistics, supply chain management,… (More)

- Ramasuri Narayanam, Y. Narahari
- IEEE Transactions on Automation Science and…
- 2011

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which… (More)

- Ramasuri Narayanam, Y. Narahari
- AAMAS
- 2008

In this paper, we consider the problem of selecting, for any given positive integer k, the top-k nodes in a social network, based on a certain measure appropriate for the social network. This problem is relevant in many settings such as analysis of co-authorship networks, diffusion of information, viral marketing, etc. However, in most situations, this… (More)

- Nukala Viswanadham, Y. Narahari, T. L. Johnson
- IEEE Trans. Robotics and Automation
- 1990

Deadlocks constitute an important issue to he addressed in the design and operation of flexible manufacturing systems (FMS’s). In this paper, we show that prevention and avoidance of FMS deadlocks can he implemented using Petri net models. For deadlock prevention, we use the reachability graph of a Petri net model of the given FMS, whereas for deadlock… (More)

- Sujit Gujar, Y. Narahari
- MALLOW
- 2009

There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem satisfying weak budget balance, individual rationality, and minimizing the budget imbalance. This calls for designing an appropriate rebate function. Our main result is an impossibility… (More)

- Shantanu Biswas, Y. Narahari
- European Journal of Operational Research
- 2004

Numerous algorithms and tools have been deployed in supply chain modeling and problem solving. These are based on stochastic models, mathematical programming models, heuristic techniques, and simulation. Since different decision problems in supply chains entail different approaches to be used for modeling and problem solving, there is a need for a unified… (More)

- Ramasuri Narayanam, Y. Narahari
- ICPR
- 2012

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through… (More)

- Sampath Kameshwaran, Y. Narahari
- European Journal of Operational Research
- 2009

This paper considers the minimization version of a class of nonconvex knapsack problems with piecewise linear cost structure. The items to be included in the knapsack have a divisible quantity and a cost function. An item can be included partially in the given quantity range and the cost is a nonconvex piecewise linear function of quantity. Given a demand,… (More)

- Y. Narahari, Pankaj Dayama
- 2005

Combinatorial Auctions (CAs) have recently generated significant interest as an automated mechanism for buying and selling bundles of goods. They are proving to be extremely useful in numerous e-business applications such as e-selling, e-procurement, e-logistics, and B2B exchanges. In this article, we introduce combinatorial auctions and bring out important… (More)

- Vikas K. Garg, Y. Narahari, M. Narasimha Murty
- IEEE Transactions on Knowledge and Data…
- 2013

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm… (More)