Incentivizing Exploration with Selective Data Disclosure

November 14, 2018 Β· Declared Dead Β· πŸ› ACM Conference on Economics and Computation

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, Zhiwei Steven Wu arXiv ID 1811.06026 Category cs.GT: Game Theory Cross-listed cs.DS, cs.LG Citations 44 Venue ACM Conference on Economics and Computation Last Checked 6 months ago
Abstract
We propose and design recommendation systems that incentivize efficient exploration. Agents arrive sequentially, choose actions and receive rewards, drawn from fixed but unknown action-specific distributions. The recommendation system presents each agent with actions and rewards from a subsequence of past agents, chosen ex ante. Thus, the agents engage in sequential social learning, moderated by these subsequences. We asymptotically attain optimal regret rate for exploration, using a flexible frequentist behavioral model and mitigating rationality and commitment assumptions inherent in prior work. We suggest three components of effective recommendation systems: independent focus groups, group aggregators, and interlaced information structures.
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