We empirically show that our algorithm has many desirable properties - it searches only a small fraction of the solution space, evenly distributes the ...

The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is ...

We empirically show that our algorithm has many desirable properties - it searches only a small fraction of the solution space, evenly distributes the ...

Mar 9, 2011 · Title: A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions ; Author: Hrishikesh J. Goradia and José M. Vidal ; Book Tittle: ...

We empirically show that our algorithm has many desirable properties - it searches only a small fraction of the solution space, evenly distributes the ...

Hrishikesh Goradia's 13 research works with 278 citations, including: A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions.

This work develops a novel, anytime algorithm that is the first to be able to solve the coalition structure generation problem for numbers of agents bigger ...

This paper describes a fast algorithm to find the nucleolus of any game with a nonempty imputation set. It is based on the algorithm scheme of Maschler et ...

In this paper, we show an alternative method for computing the nucleolus of an n-person cooperative game by solving one unique minimization linear program with ...

We present Multi-DisPel, a penalty-based local search distributed algorithm ... A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions · Author ...