Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

WAOA

2007

Springer

2007

Springer

We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then each agent decides on which of two available bins to put her load. Each bin has capacity α, and the objective is to ﬁnd a distributed protocol that minimizes the probability that an overﬂow occurs (or, equivalently, maximizes the winning probability). In this work, we focus on the cases of full information and local information, depending on whether each agent knows the loads of both other agents or not. Furthermore, we distinguish between the cases where the agents are allowed to follow diﬀerent decision rules (eponymous model) or not (anonymous model). We assume no communication among agents. First, we present optimal protocols for the full information case, for both the anonymous and the eponymous model. For the local information, anonymous case, we show that the winning probability is upper bounde...

Related Content

Added |
09 Jun 2010 |

Updated |
09 Jun 2010 |

Type |
Conference |

Year |
2007 |

Where |
WAOA |

Authors |
Panagiota N. Panagopoulou, Paul G. Spirakis |

Comments (0)