½²×ùÃû³Æ£ºOnline Advertisement Allocation Under Customer Choices and Algorithmic Fairness
½²×ùÈË£ºÈÙâß ½ÌÊÚ
½²×ùʱ¼ä£º12ÔÂ13ÈÕ14:00
½²×ùµØµã£ºÌÚѶ»áÒéÖ±²¥£¨ID:609 859 703£©
½²×ùÈ˽éÉÜ£º
ÈÙÓ¥²©Ê¿ÏÖÈÎÉϺ£½»Í¨´óѧ°²Ì©¾¼ÃÓë¹ÜÀíѧԺ½ÌÊÚ¡£ËûÓÚ2010Äê»Ø¹úÖ´½ÌÓÚÉϺ£½»Í¨´óѧ£¬´ËÇ°ÔÚÃÀ¹ú¼ÓÖÝ´óѧ²®¿ËÀû·ÖУºÍÀﺣ´óѧ´Óʲ©Ê¿ºó¿ÆÑй¤×÷£¬²¢ÔÚÉϺ£½»Í¨´óѧºÍÃÀ¹úÀﺣ´óѧ·Ö±ð»ñѧʿ¡¢Ë¶Ê¿ºÍ²©Ê¿Ñ§Î»¡£ÈÙÓ¥½ÌÊÚÖ÷ÒªÑо¿ÁìÓòΪ·þÎñϵͳµÄÔËÓªÓÅ»¯¡¢ÐÂÐËÉÌҵģÐ͵ÄÔË×÷¡¢ÁãÊÛÔËÓª¹ÜÀí¡¢¹©Ó¦Á´¹ÜÀí¡¢Êý¾ÝÇý¶¯µÄÓÅ»¯Ä£ÐÍ¡¢ÊµÖ¤Ñо¿¡£Ñо¿³É¹û·¢±íÔÚManagement Science¡¢Operations Research¡¢Manufacturing & Service Operations Management¡¢Production and Operations Management¡¢Naval Research Logistics¡¢IIE TransactionsµÈ¹ú¼ÊѧÊõ¿¯ÎïÉÏ¡£ÈÙÓ¥½ÌÊÚÊÇ2015Äê¶È¹ú¼ÒÓÅÐãÇàÄê¿Æѧ»ù½ðºÍ2020Äê¶È¹ú¼Ò½Ü³öÇàÄê¿Æѧ»ù½ð»ñµÃÕß²¢ÇÒ¶à´Î»ñµÃ¹ý¹ú¼Ê½±ÏÆäÖаüÀ¨Á½¶ÈMSOM×î¼ÑÂÛÎĽ±£¬TSL×î¼ÑÂÛÎĽ±ºÍINFORMS Energy, Natural Resources & Environment Young Researcher Prize¡£
½²×ùÄÚÈÝ£º
Advertising is a major revenue source for e-commerce platforms and an important online marketing tool for e-commerce sellers. In this paper, we explore dynamic ad allocation with limited slots upon each customer arrival for e-commerce platforms when customers follow a choice model to click the ads. Motivated by the recent advocacy for the algorithmic fairness of online ad delivery, we adjust the value from advertising by a general fairness metric evaluated with the click-throughs of different ads and customer types. The original online ad-allocation problem is intractable, so we propose a novel, stochastic program framework (called two-stage target-debt, TTD) that first decides the click-through targets then devises an ad-allocation policy to satisfy these targets in the second stage. We show the asymptotic equivalence between the original problem, the relaxed click-through target optimization, and the fluid-approximation (FA) convex program. We also design a debt-weighted offer-set (DWO) algorithm and demonstrate that, as long as the problem size scales to infinity, this algorithm is (asymptotically) optimal under the optimal first-stage click-through target. Compared to the FA heuristic and its re-solving variants, our approach has better scalability and can deplete the ad budgets more smoothly throughout the horizon, which is highly desirable for the online advertising business in practice. Finally, our proposed model and algorithm help substantially improve the fairness of ad allocation for an online e-commerce platform without compromising its efficiency much.
Ö÷°ìµ¥Î»£ºÊýѧÓëͳ¼ÆѧԺ
