Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1835698.1835785acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
research-article

Bayesian ignorance

Published: 25 July 2010 Publication History

Abstract

We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having global views. Both benevolent agents, whose goal is to minimize the social cost, and selfish agents, aiming at minimizing their own individual costs, are considered. When dealing with selfish agents, we consider both best and worst equilibria outcomes. While our model is general, most of our results concern the setting of network cost sharing (NCS) games. We provide tight asymptotic results on the effect of Bayesian ignorance in directed and undirected NCS games with benevolent and selfish agents. Among our findings we expose the counter-intuitive phenomenon that "gnorance is bliss": Bayesian ignorance may substantially improve the social cost of selfish agents. We also prove that public random bits can replace the knowledge of the common prior in attempt to bound the effect of Bayesian ignorance in settings with benevolent agents. Together, our work initiates the study of the effects of local vs. global views on the social cost of agents in Bayesian contexts.

References

[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, É. 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--753, 2001.
[14]
R. W. Rosenthal. The network equilibrium problem in integers. Networks, 3(1):53--59, 1973.

Cited By

View all
  • (2014)Algorithmic Mechanisms for Reliable Master-Worker Internet-Based ComputingIEEE Transactions on Computers10.1109/TC.2012.18663:1(179-195)Online publication date: 1-Jan-2014
  • (2013)Simultaneous auctions are (almost) efficientProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488634(201-210)Online publication date: 1-Jun-2013

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
July 2010
494 pages
ISBN:9781605588889
DOI:10.1145/1835698
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bayesian games
  2. local vs. global view
  3. network cost sharing

Qualifiers

  • Research-article

Conference

PODC '10
Sponsor:

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)1
Reflects downloads up to 12 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2014)Algorithmic Mechanisms for Reliable Master-Worker Internet-Based ComputingIEEE Transactions on Computers10.1109/TC.2012.18663:1(179-195)Online publication date: 1-Jan-2014
  • (2013)Simultaneous auctions are (almost) efficientProceedings of the forty-fifth annual ACM symposium on Theory of Computing10.1145/2488608.2488634(201-210)Online publication date: 1-Jun-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media