On the value of information in coordination games

Sandy Irani; Yuval Rabani

On the value of information in coordination games

Sandy Irani^*, Yuval Rabani

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

We discuss settings where several `agents' combine efforts to solve problems. This is a well-known setting in distributed artificial intelligence. Our work addresses theoretical questions in this model which are motivated by the work of Deng and Papadimitriou. We consider optimization problems, in particular load balancing and virtual circuit routing, in which the input is divided among the agents. An underlying directed graph, whose nodes are the agents, defines the constraints on the information each agent may have about the portion of the input held by other agents. The questions we discuss are: Given a bound on the maximum out-degree in this graph, which is the best graph? What is the quality of the solution obtained as a function of the maximum out-degree?

Original language	English
Title of host publication	Annual Symposium on Foundatons of Computer Science (Proceedings)
Editors	Anon
Publisher	Publ by IEEE
Pages	12-21
Number of pages	10
ISBN (Print)	0818643706
State	Published - 1993
Externally published	Yes
Event	Proceedings of the 34th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA Duration: 3 Nov 1993 → 5 Nov 1993

Publication series

Name	Annual Symposium on Foundatons of Computer Science (Proceedings)
ISSN (Print)	0272-5428

Conference

Conference	Proceedings of the 34th Annual Symposium on Foundations of Computer Science
City	Palo Alto, CA, USA
Period	3/11/93 → 5/11/93

Cite this

@inproceedings{b273dd176d19480c988764a1099158f2,

title = "On the value of information in coordination games",

abstract = "We discuss settings where several `agents' combine efforts to solve problems. This is a well-known setting in distributed artificial intelligence. Our work addresses theoretical questions in this model which are motivated by the work of Deng and Papadimitriou. We consider optimization problems, in particular load balancing and virtual circuit routing, in which the input is divided among the agents. An underlying directed graph, whose nodes are the agents, defines the constraints on the information each agent may have about the portion of the input held by other agents. The questions we discuss are: Given a bound on the maximum out-degree in this graph, which is the best graph? What is the quality of the solution obtained as a function of the maximum out-degree?",

author = "Sandy Irani and Yuval Rabani",

year = "1993",

language = "אנגלית",

isbn = "0818643706",

series = "Annual Symposium on Foundatons of Computer Science (Proceedings)",

publisher = "Publ by IEEE",

pages = "12--21",

editor = "Anon",

booktitle = "Annual Symposium on Foundatons of Computer Science (Proceedings)",

note = "Proceedings of the 34th Annual Symposium on Foundations of Computer Science ; Conference date: 03-11-1993 Through 05-11-1993",

}

TY - GEN

T1 - On the value of information in coordination games

AU - Irani, Sandy

AU - Rabani, Yuval

PY - 1993

Y1 - 1993

N2 - We discuss settings where several `agents' combine efforts to solve problems. This is a well-known setting in distributed artificial intelligence. Our work addresses theoretical questions in this model which are motivated by the work of Deng and Papadimitriou. We consider optimization problems, in particular load balancing and virtual circuit routing, in which the input is divided among the agents. An underlying directed graph, whose nodes are the agents, defines the constraints on the information each agent may have about the portion of the input held by other agents. The questions we discuss are: Given a bound on the maximum out-degree in this graph, which is the best graph? What is the quality of the solution obtained as a function of the maximum out-degree?

AB - We discuss settings where several `agents' combine efforts to solve problems. This is a well-known setting in distributed artificial intelligence. Our work addresses theoretical questions in this model which are motivated by the work of Deng and Papadimitriou. We consider optimization problems, in particular load balancing and virtual circuit routing, in which the input is divided among the agents. An underlying directed graph, whose nodes are the agents, defines the constraints on the information each agent may have about the portion of the input held by other agents. The questions we discuss are: Given a bound on the maximum out-degree in this graph, which is the best graph? What is the quality of the solution obtained as a function of the maximum out-degree?

UR - http://www.scopus.com/inward/record.url?scp=0027885520&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0027885520

SN - 0818643706

T3 - Annual Symposium on Foundatons of Computer Science (Proceedings)

SP - 12

EP - 21

BT - Annual Symposium on Foundatons of Computer Science (Proceedings)

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the 34th Annual Symposium on Foundations of Computer Science

Y2 - 3 November 1993 through 5 November 1993

ER -

On the value of information in coordination games

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this