Economical Graph Discovery

We consider the problem of graph discovery in settings where the graph topology is known and the edge weights are hidden. The setting consists of a weighted graph G with n vertices and m edges and with designated source s and destination t. We study two different discovery problems, namely, i edge weight discovery, where the goal is to discover all edge weights, and ii shortest path discovery, where the goal is to discover a shortest s, t-path. This discovery is done by means of agents that traverse different s, t-paths in multiple rounds and report back the total cost they incurred. Three cost models are considered, differing from each other in their approach to congestion effects. In particular, we consider congestion-free models as well as models with positive and negative congestion effects. We seek bounds on the number of rounds and the number of agents required to complete the edge weights or the shortest path discovery. Several results concerning such bounds for both directed and undirected graphs are established. Among these results, we show that 1 for undirected graphs, all edge weights can be discovered within a single round consisting of m agents, 2 discovering a shortest path in either undirected or directed acyclic graphs requires at least m-n + 1 agents, and 3 the edge weights in a directed acyclic graph can be discovered in m rounds with m + n-2 agents under congestion-aware cost models. Our study introduces a new setting of graph discovery under uncertainty and provides fundamental understanding of the problem.

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  Vladimir Grebinski,et al.  Optimal Reconstruction of Graphs under the Additive Model , 1997, Algorithmica.

[3]  D. Fudenberg,et al.  The Theory of Learning in Games , 1998 .

[4]  Moshe Tennenholtz,et al.  Learning equilibria in repeated congestion games , 2009, AAMAS.

[5]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[6]  Thomas Erlebach,et al.  Network Discovery and Verification , 2005, IEEE Journal on Selected Areas in Communications.

[7]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[8]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[9]  Noga Alon,et al.  Learning a Hidden Matching , 2004, SIAM J. Comput..

[10]  L. Shapley,et al.  Potential Games , 1994 .

[11]  Jeong Han Kim,et al.  Optimal query complexity bounds for finding graphs , 2008, Artif. Intell..

[12]  Nader H. Bshouty,et al.  Reconstructing Weighted Graphs with Minimal Query Complexity , 2009, ALT.

[13]  Noga Alon Combinatorial Nullstellensatz , 1999, Combinatorics, Probability and Computing.

[14]  R. Rosenthal A class of games possessing pure-strategy Nash equilibria , 1973 .

[15]  B. Bollobás,et al.  Combinatorics, Probability and Computing , 2006 .

[16]  Dana Angluin,et al.  Learning a Hidden Hypergraph , 2005, J. Mach. Learn. Res..

[17]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[18]  Noga Alon,et al.  Learning a Hidden Subgraph , 2004, SIAM J. Discret. Math..

[19]  Alfred O. Hero,et al.  Unicast inference of network link delay distributions from edge measurements , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[20]  Don Towsley,et al.  Multicast Topology Inference from End-to-end Measurements , 2013 .

[21]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[22]  Michael L. Littman,et al.  Markov Games as a Framework for Multi-Agent Reinforcement Learning , 1994, ICML.

[23]  Itai Ashlagi,et al.  Learning Equilibrium in Resource Selection Games , 2007, AAAI.

[24]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[25]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[26]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[27]  Martin Aigner Combinatorial search , 1988 .

[28]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[29]  Mathilde Bouvel,et al.  Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey , 2005, WG.

[30]  Alfred O. Hero,et al.  Unicast-based inference of network link delay distributions using mixed finite mixture models , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.