{"uid":"cap_ZbIR1vFUgcqJr5gB3BdZu","slug":"halowerk-ad-placement-optimizer-8f10d8b8","name":"Halowerk Ad Placement Optimizer","description":"Sorts caller-supplied placement opportunities by end time and solves the weighted non-overlapping interval problem exactly with dynamic programming. It does not buy inventory, predict conversion, enforce platform policy, model audience harm or guarantee campaign performance.","url":"https://creator.halowerk.com/v1/ad-placement-opt","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"placements":{"type":"array","items":{"type":"object","required":["id","start","end","value"],"properties":{"id":{"type":"string","maxLength":128,"minLength":1},"end":{"type":"number","maximum":1000000000000,"minimum":-1000000000000},"start":{"type":"number","maximum":1000000000000,"minimum":-1000000000000},"value":{"type":"number","maximum":1000000000000,"minimum":0}},"additionalProperties":false},"maxItems":10000,"minItems":1}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.004","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"probe","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.004/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_AvC5gWrwF-Zb-elz38i-F","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.004","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Solves the weighted non-overlapping interval scheduling problem on caller-supplied ad placements using dynamic programming, returning the optimal subset maximizing total value.","exampleAgentPrompt":"I have a list of ad placement opportunities, each with a start time, end time, and revenue value — can you run the weighted interval scheduling optimization to tell me which non-overlapping placements I should pick to maximize total value?","exampleUseCases":[{"title":"Maximize ad revenue from limited slots","prompt":"I have 20 ad placement bids for my YouTube channel this week — each has a start time, end time, and payout value. Can you figure out which non-overlapping ones I should accept to make the most money?"},{"title":"Resolve double-booking conflicts in campaign","prompt":"My campaign manager gave me a big list of placements but many of them overlap in time. Run the weighted interval scheduling algorithm to pick the best non-conflicting set that maximizes our total campaign value."},{"title":"Automate slot selection for creator inventory","prompt":"Every day I get new sponsorship slot offers with time windows and payouts. Pick the optimal non-overlapping subset automatically — I want the selection that gives the highest combined value without any two slots conflicting."}],"resultDescription":"Returns the optimal subset of non-overlapping placements (selected by their IDs) that maximizes total value, computed exactly via dynamic programming after sorting by end time. Includes the selected placement list and the maximum achievable total value.","failureModes":["Empty or missing placements array returns a validation error","Placement with start time after end time may produce unexpected results or be rejected","Values outside the allowed numeric range trigger schema validation errors","Overlapping start/end fields with non-numeric types cause 400-level errors","Very large arrays (near 10,000 items) may increase latency but remain within spec"],"whenToPreferThis":"Choose this endpoint when you need an exact, optimal solution to the weighted job/interval scheduling problem on up to 10,000 ad placements. It is deterministic and mathematically exact — prefer it over heuristic or greedy approaches when maximum value is critical. Not appropriate for probabilistic bid optimization, audience targeting, real-time RTB, or policy enforcement.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T06:33:31.066Z","isFirstParty":false}