Strategies for Utility Maximization in Social Groups with Preferential Exploration
Saurabh Aggarwal, Joy Kuri

TL;DR
This paper develops decentralized algorithms for social group nodes to maximize utility through preferential exploration and strategic exchanges, balancing cost and cooperation.
Contribution
It introduces novel algorithms based on the Stable Roommates Problem for utility maximization in social groups with preferential exploration and exchange strategies.
Findings
Decentralized algorithms achieve near-optimal utility in large groups.
Preferential exploration improves link formation efficiency.
Behavioral regimes influence the minimal cost for utility maximization.
Abstract
We consider a \emph{Social Group} of networked nodes, seeking a "universe" of segments for maximization of their utility. Each node has a subset of the universe, and access to an expensive link for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum or negligible cost, some nodes in the group try to exploit the system. We term such nodes as `non-reciprocating nodes' and prohibit such behavior by proposing the "Give-and-Take" criterion, where exchange is allowed iff each participating node has segments unavailable with the other. Following this criterion for inter-node links, each node wants to maximize its utility, which depends on the node's segment set available with the node. Link activation among nodes requires mutual consent of participating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Crowdsensing and Crowdsourcing · Complex Network Analysis Techniques · Opinion Dynamics and Social Influence
