An Optimal Assignment Procedure for Multiple Online Surveys

• Autorzy: Bogumił Kamiński , Mariusz Kozakiewicz , Wit Jakuczun , Małgorzata Półtorak
• Języki publikacji: EN

Abstrakty

EN

The problem of optimal assignment of respondents to internet surveys has been considered. The task is taken from a leading online research company in Central and Eastern Europe, which runs several dozen surveys in parallel. Each survey is assigned a target number of responses to be collected and unique selection criteria for choosing respondents based on their socio-demographic data. A mathematical programming model has been proposed that enables us to find an optimal mechanism for assigning respondents to surveys so as to minimize the required total number of invitations to surveys issued. A side effect of the assignment procedure is that the samples obtained are not representative of the population under survey. Therefore, a sample weighting scheme has been developed that takes this fact into account and allows us to obtain unbiased estimators of the characteristics of the population surveyed. (original abstract)

Słowa kluczowe

EN

Questionnaire survey; Internet; Mathematical programming

PL

Badania ankietowe; Internet; Programowanie matematyczne

• Czasopismo: Operations Research and Decisions
• Rocznik: 2012
• Tom: 22
• Numer: nr 4
• Strony: 69--85

Twórcy

autor

Bogumił Kamiński

• Warsaw School of Economics, Poland

autor

Mariusz Kozakiewicz

• Warsaw School of Economics, Poland

autor

Wit Jakuczun

• Warsaw School of Economics, Poland

autor

Małgorzata Półtorak

• Gemius SA

Bibliografia

• [1] CALINESCU M., BHULAI S., SCHOUTEN B., Optimal scheduling of contact attempts in mixed mode surveys, Statistics Netherlands, Hague, The Netherlands, 2011.
• [2] EFRON B., Bootstrap methods: another look at the jackknife, The Annals of Statistics, 1979, 7 (1), 1-26.
• [3] HERRINGA S.G., GROVES R.M., Responsive design for household surveys: tools for actively controlling survey errors and costs, Journal of the Royal Statistical Society: Series A, Statistics in Society, 2006, 169, 439-457.
• [4] KARP R.M., VAZIRANI U.V., VAZIRANI V.V., 1990, An optimal algorithm for on-line bipartatie matching, STOC '90, Proceedings of the twenty-second annual ACM symposium on theory of computing, Baltimore, 13-17.05.1990, 352-358.
• [5] LOHR S., RAO J.N.K., Estimation in Multiple-Frame Surveys, Journal of the American Statistical Association, 2006, 101, 1019-1030.
• [6] PUTERMAN M.L., Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley, Hoboken, New Jersey 1994.
• [7] SELM VAN M., JANKOWSKI N.W., Conducting Online Surveys, Quality and Quantity, 2006, 40, 435-456.
• [8] SINGH A., TANEJA A., MANGALARAJ G., Creating Online Surveys: Some Wisdom from the Trenches Tutorial, IEEE Transactions on Professional Communication, 2009, 52 (2), 197-212.
• [9] SUE V.M., RITTER L.A., Conducting Online Surveys, SAGE Publications, Los Angeles 2006.
• [10] VEE E., VASSILVITSKII S., SHANMUGASUNDARAM J., Optimal online assignment with forecasts, ACM, Cambridge, Massachusetts, USA, 2010.

Identyfikatory

DOI

10.5277/ord120404