Stock Image

Algorithms for Coalition Formation in Multi-Agent Systems: Distinguished Dissertation 2008

Talal Rahwan

0 ratings by Goodreads
ISBN 10: 1906124140 / ISBN 13: 9781906124144
Published by British Computer Society
New Condition: New Soft cover
From BuySomeBooks (Las Vegas, NV, U.S.A.)

AbeBooks Seller Since May 21, 2012

Quantity Available: 20
Buy New
List Price: US$ 75.00
Price: US$ 110.62 Convert Currency
Shipping: US$ 3.95 Within U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy


About this Item

Paperback. 136 pages. Dimensions: 11.5in. x 8.1in. x 0.5in.Software agents situated in the same environment typically need to interact with one another in order to fulfill their objectives or improve their performance. Coalition formation is a fundamental form of interaction that has proven to be useful in a number of scenarios, including: - sensor networks; - e-commerce; - distributed vehicle routing. Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining which of the potential coalitions to form in order to achieve some goal. This usually requires calculating a value for every coalition, known as the coalition value, which indicates how beneficial that coalition would be if it was formed. Once these values are calculated, the agents need to find a combination of coalitions of which the sum of values is maximized, and in which every agent belongs to exactly one coalition. Finding an optimal, or near-optimal, solution to this coalition structure generation problem is extremely challenging due to the large number of possible solutions. To date, many algorithms have been proposed to solve this problem using different techniques - ranging from dynamic programming, to integer programming, to stochastic search - all of which suffer from major limitations relating to execution time, solution quality, and memory requirements. Against this background, this thesis presents a novel algorithm for distributing the coalition-value calculations among the agents. The algorithm is decentralized, requires no communication between the agents, has minimal memory requirements, and can reflect variations in the computational speeds of the agents. We also develop an anytime algorithm for coalition structure generation. By using a novel representation of the search space, and by applying branch-and-bound techniques, the algorithm is shown to significantly outperform other existing ones in the literature. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Bookseller Inventory # 9781906124144

Ask Seller a Question

Bibliographic Details

Title: Algorithms for Coalition Formation in ...

Publisher: British Computer Society

Binding: Paperback

Book Condition:New

Book Type: Paperback

About this title

Synopsis:

Software agents situated in the same environment typically need to interact with one another in order to fulfill their objectives or improve their performance. Coalition formation is a fundamental form of interaction that has proven to be useful in a number of scenarios, including: - sensor networks; - e-commerce; - distributed vehicle routing. Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining which of the potential coalitions to form in order to achieve some goal. This usually requires calculating a value for every coalition, known as the coalition value, which indicates how beneficial that coalition would be if it was formed. Once these values are calculated, the agents need to find a combination of coalitions of which the sum of values is maximized, and in which every agent belongs to exactly one coalition. Finding an optimal, or near-optimal, solution to this coalition structure generation problem is extremely challenging due to the large number of possible solutions. To date, many algorithms have been proposed to solve this problem using different techniques - ranging from dynamic programming, to integer programming, to stochastic search - all of which suffer from major limitations relating to execution time, solution quality, and memory requirements. Against this background, this thesis presents a novel algorithm for distributing the coalition-value calculations among the agents. The algorithm is decentralized, requires no communication between the agents, has minimal memory requirements, and can reflect variations in the computational speeds of the agents. We also develop an anytime algorithm for coalition structure generation. By using a novel representation of the search space, and by applying branch-and-bound techniques, the algorithm is shown to significantly outperform other existing ones in the literature.

About the Author:

Talal Rahwan is a research fellow at the School of Electronics & Computer Science, University of Southampton where he was originally awarded an Overseas Research Scholarship to do his Ph.D, after graduating in 2003 from the University of Aleppo, Syria. His research has been published in premium artificial intelligence conferences and journals.

"About this title" may belong to another edition of this title.

Store Description

BuySomeBooks is great place to get your books online. With over eight million titles available we're sure to have what you're looking for. Despite having a large selection of new books available for immediate shipment and excellent customer service, people still tell us they prefer us because of our prices.

Visit Seller's Storefront

Terms of Sale:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

BuySomeBooks is operated by Drive-On-In, Inc., a Nevada co...

More Information
Shipping Terms:

Orders usually ship within 1-2 business days. Books are shipped from multiple locations so your order may arrive from Las Vegas,NV, Roseburg,OR, La Vergne,TN, Momence,IL, or Commerce,GA.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express