A Knapsack-Based Approach to Bidding in Ad Auctions

@inproceedings{Berg2010AKA,
  title={A Knapsack-Based Approach to Bidding in Ad Auctions},
  author={Jordan Berg and Amy Greenwald and Victor Naroditskiy and Eric Sodomka},
  booktitle={ECAI},
  year={2010}
}
We model the problem of bidding in ad auctions as a penalized multiple choice knapsack problem (PMCKP), a combination of the multiple choice knapsack problem (MCKP) and the penalized knapsack problem (PKP) [1]. We present two versions of PMCKP, GlobalPMCKP and LocalPMCKP, together with a greedy algorithm that solves the linear relaxation of a GlobalPMCKP optimally. We also develop a greedy heuristic for solving LocalPMCKP. Although our heuristic is not optimal, we show that it performs well in… CONTINUE READING

From This Paper

Topics from this paper.
8 Citations
5 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Wagelmans, ‘A branch-and-price algorithm for the multiperiod single-sourcing

  • R. Freling, H. E. Romeijn, D. R. Morales, A.P.M
  • problem’,Operations Research,
  • 2003
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…