Hey there! 👋 Welcome to Hu Ray's playground, where you can find blog posts about tech, life stories, and maybe some notes. Grab a cup of ☕️ and let's have some fun!
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!
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!
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!
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.
As we delve into the realm of multiagent decision making, game theory emerges as a powerful tool for understanding strategic interactions between self-interested agents. Born from the intersection of economics, mathematics, and computer science, game theory provides a robust framework for analyzing complex decision-making processes. In this post, we’ll embark on an exploration of the game theory foundations that underlie the intricate dance of cooperation and competition among self-interested agents. This journey will cover the essential concepts and theories that form the backbone of Lecture 8 in the SC4003 course at NTU. Buckle up, and let’s dive into the fascinating world of game theory!