🌟 Visiting Lecturer: Exploring Problem Solving Using Discrete Mathematics and Game Theory
Mathematics is often associated with numbers, formulas, and rigid calculations. However, in reality, mathematics goes far beyond mere arithmetic operations. It is a powerful tool for solving problems, uncovering hidden patterns and structures, and aiding in rational and strategic decision-making. In this context, discrete mathematics and game theory play a crucial role, especially in addressing complex challenges that arise in real life.
📅 Event Overview
To introduce these concepts, the Department of Mathematics, Faculty of Science and Mathematics, Diponegoro University, organized a visiting lecturer session conducted online via Zoom with the title “The Hidden Mathematics of Choice” on Wednesday, May 7, 2025. The Department invited Dr. Nika Salia, a lecturer from the Department of Mathematics, College of Computing and Mathematics, King Fahd University of Petroleum and Minerals (KFUPM), Dahran, Kingdom of Saudi Arabia, as the speaker.
(Note: Image placeholder for the session by Dr. Nika Salia)
🕐 Event Schedule and Participants
The event started at 1:00 PM WIB with an opening speech by Dr. Susilo Hariyanto S.Si., M.Si., the head of the Department of Mathematics. The material session and discussion were moderated by Benediktus Panji Pradipta, S.Si., M.Sc. The material session was divided into three parts, corresponding to three different problems presented by Dr. Nika Salia.
🔍 Session Content Highlights
1. Perfect Matching Problem on a Hypothetical Island
In the first part, Dr. Nika Salia asked participants to imagine an island divided into 100 hunting areas of equal size and 100 farming areas of equal size. There are 100 families, each to be assigned one hunting area and one farming area. The question was how to pair each family with a hunting area and a farming area such that the two areas overlap, as the overlapping part would be used to build the family’s house. Dr. Nika Salia began the discussion using graph theory, particularly focusing on the concept of perfect matching.
2. Stable Marriage Problem
The second problem discussed was about matching pairs to achieve stable marriages. This problem was addressed using the Gale-Shapley algorithm, a well-known method in game theory and discrete mathematics for finding stable matchings.
3. Map Coloring Problem
The third problem involved map coloring, where the solution employed Euler’s formula on planar graphs. This problem is fundamental in graph theory and has applications in various fields such as geography and computer science.
🕒 Conclusion and Attendance
The discussion concluded at 3:45 PM WIB, with more than 100 participants attending the session.
🎥 Replay Access
The visiting lecturer session can be re-watched through the following recorded links:
Part 1 : https://bit.ly/VLDrNikaSaliaPart1
Part 2 : https://bit.ly/VLDrNikaSaliaPart2.