Optimizing Streaming Applications with Self-Interested Users using M-DPOP

DSpace/Manakin Repository

Optimizing Streaming Applications with Self-Interested Users using M-DPOP

Citable link to this page

. . . . . .

Title: Optimizing Streaming Applications with Self-Interested Users using M-DPOP
Author: Faltings, Boi; Parkes, David C.; Petcu, Adrian; Shneidman, Jeffery

Note: Order does not necessarily reflect citation order of authors.

Citation: Faltings, Boi, David Parkes, Adrian Petcu, and Jeff Shneidman. 2006. Optimizing streaming applications with self-interested users using M-DPOP. In Proceedings of the 1st International Workshop on Computational Social Choice: December 6-8, 2006, Amsterdam, ed. U. Endriss, J. Lang, 206-219. Amsterdam: Institute for logic, language and computation.
Full Text & Related Files:
Abstract: In this paper we deal with the problem of optimally placing a set of query operators in an overlay network. Each user is interested in performing a query on streaming data and each query has an associated set of in-network operators that filter, aggregate and process the data in various ways. Each user has private information about the operators associated with a query and about the utility from different combinations of operator placements. Each server in the overlay network is able to perform some set of operators, and servers differ in their network and computational characteristics. We model this problem as a Distributed Constraint Optimization Problem (DCOP). On this DCOP model, we apply the MDPOP algorithm from Petcu et al. that is executed by clients associated with users and situated at nodes on the overlay network. MDPOP makes truth-telling an \textit{ex-post Nash equilibrium}, and determines the social-welfare maximizing placement of operators to servers. No client can benefit by deviating from the MDPOP algorithm. Nodes need only communicate with other nodes that have an interest in placing an operator on the same server. Structure can be exploited, where it exists, to provide a scalable algorithm. The only central authority required is a bank that can extract payments from users. In addition, it is possible to develop a faithful method to redistribute some of the VCG payments back to users when desired.
Published Version: http://staff.science.uva.nl/~ulle/COMSOC-2006/
Other Sources: http://www.eecs.harvard.edu/~jeffsh/pubs/Faltings2006.pdf
http://www.illc.uva.nl/Publications/ResearchReports/X-2006-04.text.pdf
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4031555

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7105]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters