کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
7549339 | 1489878 | 2015 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The truncated geometric election algorithm: Duration of the election
ترجمه فارسی عنوان
الگوریتم انتخابی هندسی تقسیم شده: مدت انتخابات
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آمار و احتمال
چکیده انگلیسی
The present paper makes three distinct improvements over an earlier investigation of Kalpathy and Ward. We analyze the length of the entire election process (not just one participant's duration), for a randomized election algorithm, with a truncated geometric number of survivors in each round. We not only analyze the mean and variance; we analyze the asymptotic distribution of the entire election process. We also introduce a new variant of the election that guarantees a unique winner will be chosen; this methodology should be more useful in practice than the previous methodology. The method of analysis includes a precise analytic (complex-valued) approach, relying on singularity analysis of probability generating functions.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Statistics & Probability Letters - Volume 101, June 2015, Pages 40-48
Journal: Statistics & Probability Letters - Volume 101, June 2015, Pages 40-48
نویسندگان
Guy Louchard, Mark Daniel Ward,