Penerapan Algoritma Sattolo Shuffle Dalam Sistem Distribusi Kupon Undian Digital Pada Platform E-Commerce

Surya Darma Nasution; Guidio Leonarde Ginting

doi:10.62866/buai.v4i1.221

Surya Darma Nasution * Sekolah Tinggi Ilmu Manajemen Sukma, Medan, Indonesia
Guidio Leonarde Ginting Sekolah Tinggi Ilmu Manajemen Sukma Medan, Indonesia

(*) Corresponding Author

DOI: https://doi.org/10.62866/buai.v4i1.221

Keywords: Sattolo Shuffle Algorithm; Digital Coupon Distribution; Cyclic Permutation; E-Commerce; Randomization

Abstract

The distribution of digital lottery coupons on e-commerce platforms requires a fair and efficient randomization mechanism. This study implements the Sattolo Shuffle algorithm as a digital coupon distribution mechanism with a case study of 20 coupons to 20 users. The Sattolo Shuffle algorithm is a modification of the Fisher-Yates Shuffle that produces cyclic permutations, where every element is guaranteed to move from its original position. The shuffling process was carried out through 19 iterations (n-1) and verified through fixed point analysis, permutation cycle tracking, and coupon distribution to users. Test results show 0 fixed points (100% elements moved), a single cycle covering all elements, and even coupon category distribution. Comparison with standard Fisher-Yates and Naive Shuffle confirms Sattolo Shuffle superiority in derangement guarantee, distribution fairness, and O(n) computational efficiency

References

A. Ibijola and A. Olu, “A Simulated Enhancement of Fisher-Yates Algorithm for Shuffling in Virtual Card Games using Domain-Specific Data Structures,” Int. J. Comput. Appl., vol. 54, no. 11, pp. 975–8887, 2012.

S. D. Nasution and S. Suginam, “Modifikasi Algoritma Fisher Yates Shuffle Menggunakan Linear Congruent Method Untuk Pembangkitan Bilangan Acak,” Jurnal Ilmu Komputer, vol. 12, no. 2, pp. 101–106, 2019.

J. Hamari, J. Koivisto, and H. Sarsa, “Does gamification work? - A literature review of empirical studies on gamification,” in Proceedings of the Annual Hawaii International Conference on System Sciences, IEEE Computer Society, 2014, pp. 3025–3034. doi: 10.1109/HICSS.2014.377.

L. Hu, M. Zhang, and X. Wen, “Optimal distribution strategy of coupons on e-commerce platforms: Sufficient or scarce?,” Int. J. Prod. Econ., vol. 266, p. 109031, 2023, doi: 10.1016/j.ijpe.2023.109031.

V. Kumar and B. Rajan, “Social coupons as a marketing strategy: A multifaceted perspective,” J. Acad. Mark. Sci., vol. 40, no. 1, pp. 120–136, Jan. 2012, doi: 10.1007/s11747-011-0283-0.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms Third Edition Introduction to Algorithms. 2009.

S. Bulolo, “Implementasi Metode Linear Congruent Method (LCM) pada Simulasi Ujian Akhir Sekolah Menengah Kejuruan Lolomatua,” in Prosiding Seminar Nasional Teknologi Informatika, 2019, pp. 60–64.

S. Angelina and A. D. Wowor, “Optimasi Pembangkit Bilangan Acak Dengan Fungsi Polinomial Dan Kombinasi Metode Iterasi,” JIKO (Jurnal Informatika dan Komputer), vol. 8, no. 2, p. 367, Sep. 2024, doi: 10.26798/jiko.v8i2.1313.

M. Yohanna, F. G. N. Larosa, and D. F. Malau, “Aplikasi Ujian Try Out Dengan Menerapkan Algoritma Fisher Yates Shuffle,” Jurnal Teknik Informatika, vol. 14, no. 2, 2022.

M. A. Hasan, S. Supriadi, and Z. Zamzami, “Implementasi Algoritma Fisher-Yates Untuk Mengacak Soal Ujian Online Penerimaan Mahasiswa Baru (Studi Kasus : Universitas Lancang Kuning Riau),” Jurnal Nasional Teknologi dan Sistem Informasi, vol. 3, no. 2, pp. 291–298, Sep. 2017, doi: 10.25077/teknosi.v3i2.2017.291-298.

I. Febriani, R. Ekawati, U. Supriadi, and M. I. Abdullah, “Fisher-Yates shuffle algorithm for randomization math exam on computer based-test,” in AIP Conference Proceedings, American Institute of Physics Inc., Apr. 2021. doi: 10.1063/5.0042534.

S. C. Santo and N. M. S. Iswari, “Design and Development of Animal Recognition Application Using Gamification and Sattolo Shuffle Algorithm on Android Platform Case Study: Kebun Binatang Ragunan,” 46 IJNMT, vol. IV, no. 1, pp. 46–53, 2017.

S. Sattolo, “An Algorithm To Generate A Random Cyclic Permutation,” 1986.

M. C. Wilson, “Overview of Sattolo’s Algorithm,” 2002. [Online]. Available: http://algo.inria.fr/seminars/.

Yusfrizal, D. Adhar, U. Indriani, E. Panggabean, A. Sabir, and H. Kurniawan, “Application of the Fisher-Yates Shuffle Algorithm in the Game Matching the World Monument Picture,” in 2020 2nd International Conference on Cybernetics and Intelligent System, ICORIS 2020, Institute of Electrical and Electronics Engineers Inc., Oct. 2020. doi: 10.1109/ICORIS50180.2020.9320766.

Y. Arviansyah, N. Nurfaizah, and R. Waluyo, “Penerapan Algoritma Fisher Yates Shuffle Pada Aplikasi TOEFL Preparation Berbasis Web,” Jurnal Buana Informatika, vol. 11, no. 2, pp. 112–122, 2020.

F. Fujiati and S. Lestari Rahayu, “Implementasi Algoritma Fisher Yate Shuffle Pada Game Edukasi Sebagai Media Pembelajaran,” Cogito Smart Journal, vol. 6, no. 1, 2020.

S. D. Nasution and G. L. Ginting, “Bulletin of Artificial Intelligence Implementasi Algoritma Sattolo Shuffle Untuk Optimasi Pengacakan Pada Game Solitaire,” Bulletin of Artificial Intelligence, vol. 3, no. 2, pp. 42–49, Oct. 2024, doi: 10.62866/buai.v3i2.200.

H. M. Mahmoud, “Mixed Distributions in Sattolo’s Algorithm for Cyclic Permutations Via Randomization and,” J. Appl. Probab., vol. 40, no. 3, pp. 790–796, 2003, [Online]. Available: http://about.jstor.org/terms

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Penerapan Algoritma Sattolo Shuffle Dalam Sistem Distribusi Kupon Undian Digital Pada Platform E-Commerce