Ray's Site 🎒

Hotkeys are indispensable for enhancing user experience in Windows desktop applications. They enable users to quickly access features, trigger actions, or interact with specific controls using keyboard combinations. In this post, we examine the technical classification of hotkeys within the Windows environment and explore the underlying implementation mechanisms, with a comparative look at how native Win32 APIs and the Qt framework handle these operations.

Continue reading →

Coalitional games are a type of game theoretical model that study scenarios where agents can reap mutual benefits from cooperation. In such games, a coalition is a group of agents that work together and obtain a payoff for their collective effort. The agents are considered “cooperative” since cooperation yields them more payoffs than non-cooperation. This post discusses on coalition in Lecture 11 in the SC4003 course in NTU. See details below!

Continue reading →

In the previous post, we examined how agents make decisions in two-agent games, focusing on the Nash Equilibrium. In this post, we will explore how a group of agents make decisions, delving into the realm of social choice theory. A classic example of social choice theory is voting, where the challenge is to combine individual preferences to derive a social outcome. This post discusses voting mechanism in group decision making in Lecture 10 of the SC4003 course in NTU. Let’s begin!

Continue reading →

The allocation of scarce resources, such as physical objects or computing resources, among multiple agents is a crucial aspect of multi-agent systems. When resources are abundant or uncontested, allocation is straightforward. However, in reality, we often face scarcity and competition, which is where auction mechanisms come into play. Once considered rare, auctions have become a common method for resource allocation in various domains. We will cover the auction mechanism in Lecture 9 in the SC4003 course at NTU. Get ready!

Continue reading →

String matching is a fundamental problem in computer science, which involves finding the first occurrence of a given pattern in a text. This problem arises in many applications, such as searching for a character string in a text, finding a pattern in DNA sequences, decoding graphical or audio data, or searching for a sublist in linked lists. In this post, we will explore three different approaches to solving the string matching problem: a straightforward solution, the Rabin-Karp Algorithm, and the Boyer-Moore Algorithm. Also, this post is a lecture notes of the SC2001 course in NTU, covering common string matching algorithms.

Continue reading →