Handling interdependent values in an auction mechanism for bandwidth allocation in tactical data networks

7Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

We consider a tactical data network with limited bandwidth, in which each agent is tracking objects and may have value for receiving data from other agents. The agents are self-interested and would prefer to receive data than share data. Each agent has private information about the quality of its data and can misreport this quality and degrade or otherwise decline to share its data. The problem is one of interdependent value mechanism design because the value to one agent for the broadcast of data on an object depends on the quality of the data, which is privately known to the sender. A recent two-stage mechanism due to Mezzetti (2004) can be modified to our setting. Our mechanism achieves efficient bandwidth allocation and provides incentive compatibility by conditioning payments on the realized value for data shared between agents. © 2008 ACM.

Cite

CITATION STYLE

APA

Klein, M., Moreno, G. A., Parkes, D. C., Plakosh, D., Seuken, S., & Wallnau, K. (2008). Handling interdependent values in an auction mechanism for bandwidth allocation in tactical data networks. In SIGCOMM 2008 Conference and the Co-located Workshops - Proceedings of the 3rd International Workshop on Economics of Networked Systems, NetEcon’08 (pp. 73–78). https://doi.org/10.1145/1403027.1403044

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free