{"paper":{"title":"The Ad Types Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Christopher A. Wilkens, Juli\\'an Mestre, Okke Schrijvers, Riccardo Colini-Baldeschi","submitted_at":"2019-07-09T20:34:46Z","abstract_excerpt":"The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are $k$ types of nodes on one side (the ads), and an ordered set of nodes on the other side (the slots). The edge weight of an ad $i$ of type $\\theta$ to slot $j$ is $v_i\\cdot \\alpha^{\\theta}_j$ where $v_i$ is an advertiser-specific value and each ad type $\\theta$ has a discount curve $\\alpha^{(\\theta)}_{1} \\ge \\alpha^{(\\theta)}_{2} \\ge ... \\ge 0$ over the slots that is common for ads of type $\\theta$. We present two contributions for this problem: 1) we give an algorithm that finds the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04400","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}