Bayesian ignorance

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 384-391

  Alon, Noga ^a   Emek, Yuval ^a   Feldman, Michal ^b   Tennenholtz, Moshe ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Bayesian games; Local vs. global view; Network cost sharing

Indexed keywords

BAYESIAN; BAYESIAN GAME; BENEVOLENT AGENT; COUNTER-INTUITIVE PHENOMENON; GLOBAL VIEW; NETWORK COSTS; RANDOM BITS; SELFISH AGENTS; SOCIAL COST;

ASYMPTOTIC ANALYSIS; BAYESIAN NETWORKS; COST EFFECTIVENESS;

COSTS;

EID: 77956249028     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835785     Document Type: Conference Paper

References (14)

1. S. Albers. On the Value of Coordination in Network Design. SIAM J. Comput. (SICOMP), 38(6):2273-2302, 2009.
2. N. Alon and Y. Azar. On-line Steiner trees in the Euclidean plane. In Proc. of the 8th Symp. on Computational Geometry (SoCG), pages 337-343, 1992.
3. N. Andelman, M. Feldman, and Y. Mansour. Strong Price of Anarchy. In Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007.
4. E. Anshelevich, A. Dasgupta, J.M. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. SIAM J. Comput. (SICOMP), 38(4):1602-1623, 2008.
5. I. Ashlagi, D. Monderer, and M. Tennenholtz. Two-Terminal Routing Games with Unknown Active Players. Artificial Intelligence Journal, 173(15):1441-1455, 2009.
6. H.L. Chen, and T. Roughgarden. Network design with weighted players. In Proc. ACM Symp. on Parallel Algorithms and Architecture (SPAA), pages 29-38, 2006.
7. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. (JCSS), 69(3):485-497, 2004.
8. I. Gilboa, and E. Lehrer. The Value of Information - An Axiomatic Approach. Journal of Mathematical Economics, 20: 443-459, 1991.
9. A. Gupta. Steiner points in tree metrics don't (really) help. In Proc. of the 12th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 220-227, 2001.
10. R.A. Howard. Information value theory. IEEE Transactions on Systems Science and Cybernetics, 2: 22-26, 1996.
11. M. Imase and B.M. Waxman. Dynamic Steiner tree problem. SIAM J. Discrete Math. (SIDMA), 4(3):369-384, 1991.
12. E. Koutsoupias, and C.H. Papadimitriou. Worst-case equilibria. In Proc. 16th Symp. Theoretical Aspects of Computer Science (STACS), 1999.
13. C.H. Papadimitriou. Algorithms, games, and the Internet. In Proc. 33rd Symp. Theory of Computing (STOC), 749-U753, 2001.
14. R.W. Rosenthal. The network equilibrium problem in integers. Networks, 3(1):53-59, 1973.