Incentivizing Sharing in Realtime D2D Streaming Networks: A Mean Field Game Perspective

April 08, 2016 Β· Declared Dead Β· πŸ› IEEE/ACM Transactions on Networking

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jian Li, Rajarshi Bhattacharyya, Suman Paul, Srinivas Shakkottai, Vijay Subramanian arXiv ID 1604.02435 Category cs.GT: Game Theory Cross-listed cs.PF, cs.SI Citations 65 Venue IEEE/ACM Transactions on Networking Last Checked 5 months ago
Abstract
We consider the problem of streaming live content to a cluster of co-located wireless devices that have both an expensive unicast base-station-to-device (B2D) interface, as well as an inexpensive broadcast device-to-device (D2D) interface, which can be used simultaneously. Our setting is a streaming system that uses a block-by-block random linear coding approach to achieve a target percentage of on-time deliveries with minimal B2D usage. Our goal is to design an incentive framework that would promote such cooperation across devices, while ensuring good quality of service. Based on ideas drawn from truth-telling auctions, we design a mechanism that achieves this goal via appropriate transfers (monetary payments or rebates) in a setting with a large number of devices, and with peer arrivals and departures. Here, we show that a Mean Field Game can be used to accurately approximate our system. Furthermore, the complexity of calculating the best responses under this regime is low. We implement the proposed system on an Android testbed, and illustrate its efficient performance using real world experiments.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Game Theory

R.I.P. πŸ‘» Ghosted

Blockchain Mining Games

Aggelos Kiayias, Elias Koutsoupias, ... (+2 more)

cs.GT πŸ› EC πŸ“š 273 cites 10 years ago

Died the same way β€” πŸ‘» Ghosted