Can we design program for conjoint experiment in Kobo? In my questionnaire, there are 4 attributes and each has different values. We will have to ask 4 rounds to each respondent and each round will contain a pair of process. But again we have to randomize both attributes and values simultaneously. I have attached sample question below.
Please anyone can walk me through!! Conjoint|573x500
However you cannot (presently) readily randomize the actual order of presented questions in a form. [there are some hacks that will appear to present the same questions in a psuedo-random order, but these are rather burdomsome to implement]
@Xiphware Thank you!
What I wanted to do is there are 4 attributes and each has different values like,
Now for the first round, I wanted to make a pair which will contain randomly assign a value of the corresponding attributes and named them as Process-1 and Process-2. Let say
the respondent will choose these processes and will give a number ranging from 0-10 [0= No support at all, 10= total support]. Similarly, for the second round, I want to randomize both attributes and values. like,
in this way, we will have up to four rounds. In each round, attributes should be in the same order but different from the previous, however, values should randomly assign in each process.
Does it make sense to you?
Have a great day!!!
Unfortunately, this is a much harder problem… Picking a (single) random number is easy, as easy as throwing a dart at a dartboard. Picking two random numbers is just as easy as throwing two darts at a dartboard. But picking two different random numbers (from a discrete set) entails throwing two different darts at two different dartboards! [the second dartboard conveniently not containing the number you first hit].
Unfortunately this doesn’t actually help. You still need to generate a new random number, one which differs, but there’s as always a finite probability of generating the same number as before. So technically you could end up having to re-generate the second random number an indeterminate number of times till you get one that is actually different (think flipping a coin - exactly how many times do you have to flip it till you get a result that differs from the first flip?).
But moving on from STATS101… One approach - if you have a relatively small set of possible numbers - is to generate list of all possible permutations; eg for 4 numbers: “1-2 1-3 1-4 2-1 2-3 2-4 3-1 3-2 3-4 4-1 4-2 4-3”, use the earlier solution to pick one at random, and then extract the two selected numbers from the result (hint: use substring-before() and substring-after()). Its a bit brute force but it should get the job done and ensure both randomness and that the two numbers will be unique.
BTW, I do know of another solution, one that exploits the ODK randomize() function, but unfortunately this only works under Enketo and doesn’t work with ODK Collect/KoboCollect (yet…)