Approximation Algorithms for Coordinating Ad Campaigns on Social Networks

@inproceedings{Lakhotia2019ApproximationAF,
  title={Approximation Algorithms for Coordinating Ad Campaigns on Social Networks},
  author={Kartik Lakhotia and David Kempe},
  booktitle={CIKM '19},
  year={2019}
}
  • Kartik Lakhotia, David Kempe
  • Published in CIKM '19 2019
  • Computer Science
  • We study a natural model of coordinated social ad campaigns over a social network, based on models of Datta et al. and Aslay et al. Multiple advertisers are willing to pay the host - up to a known budget - per user exposure, whether that exposure is sponsored or organic (i.e., shared by a friend). Campaigns are seeded with sponsored ads to some users, but no network user must be exposed to too many sponsored ads. As a result, while ad campaigns proceed independently over the network, they need… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES

    KONECT: the Koblenz network collection

    VIEW 14 EXCERPTS
    HIGHLY INFLUENTIAL

    Approximation Algorithms for Coordinating

    • Kartik Lakhotia, David Kempe
    • Ad Campaigns on Social Networks
    • 2019
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Influence Maximization in Near-Linear Time: A Martingale Approach

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Influence maximization: near-optimal time complexity meets practical efficiency

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Maximizing Social Influence in Nearly Optimal Time

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL