کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
393781 665685 2014 25 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Balanced allocation mechanism: An optimal mechanism for multiple keywords sponsored search auctions
ترجمه فارسی عنوان
مکانیسم تخصیص متعادل: یک مکانیسم بهینه برای جستجوهای چندگانه مورد جستجو در موتورهای جستجو
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی

This paper presents an optimal mechanism for allocating slots of multiple keywords to bidders who have only one budget limit for all their desired keywords; it is called the balanced allocation mechanism. In a balanced allocation, all the bidders and slots for the keywords are partitioned into consecutive and distinct structures called balanced blocks. The study develops efficient algorithms for this mechanism. For instance, an algorithm is developed to create a “perfect schedule” for each independent, balanced block. Using this scheduling, all the slots and budgets of all bidders will be consumed. The balanced allocation mechanism creates a balanced allocation with perfect scheduling for each balanced block. This research confirms that this is an optimal truthful mechanism that maximizes the revenue of a search engine.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 262, 20 March 2014, Pages 190–214
نویسندگان
, ,