Prompt mechanism for online auctions with multi-unit demands

摘要: We study the following TV ad placement problem: $$m$$m identical time-slots are on sale within a period of days and only one time-slot is available each day. Advertisers arrive depart online to bid for some publish their ads. Typically, advertiser $$i$$i arrives at $$a_i$$ai'th day wishes that her would be published most $$s_i$$si before she departs. The goal maximize social welfare which sum values In this paper, we design competitive mechanism in motivated report private value truthfully can learn payment very moment wins time-slots. When all demands $$s_i$$si's uniform, prove our achieves non-trivial ratio $$5$$5. also general cases derive upper lower bounds.