Fair Information Sharing for Treasure Hunting

  title={Fair Information Sharing for Treasure Hunting},
  author={Yiling Chen and Kobbi Nissim and Bo Waggoner},
In a search task, a group of agents compete to be the first to find the solution. Each agent has different private information to incorporate into its search. This problem is inspired by settings such as scientific research, Bitcoin hash inversion, or hunting for some buried treasure. A social planner such as a funding agency, mining pool, or pirate captain might like to convince the agents to collaborate, share their information, and greatly reduce the cost of searching. However, this… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
10 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-2 of 2 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 10 references

On the value of private information

  • J. Kleinberg, C. H. Papadimitriou, P. Raghavan
  • In Proceedings of the 8th Conference on…
  • 2001
1 Excerpt

The division of cognitive labor

  • P. Kitcher
  • The Journal of Philosophy
  • 1990
1 Excerpt

Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator

  • A. Dvoretzky, J. Kiefer, J. Wolfowitz
  • The Annals of Mathematical Statistics
  • 1956
1 Excerpt

Similar Papers

Loading similar papers…