stable-matching

GenPark AI Agent Skill - Gale-Shapley deferred acceptance algorithm ensuring stable, envy-free, and Pareto-efficient bipartite matching between autonomous agents and task markets.

GenPark AI Agent Skill - Gale-Shapley deferred acceptance algorithm ensuring stable, envy-free, and Pareto-efficient bipartite matching between autonomous agents and task markets.

Gale-Shapley deferred acceptance algorithm engine solving stable matching problems with Pareto-optimal proposer guarantees.

Gale-Shapley deferred acceptance algorithm engine solving stable matching problems with Pareto-optimal proposer guarantees.

Demonstration of the Gale-Shapley to compute a stable matching

Weekly Kattis exercises, implementing various algorithms introduced in the course on Algorithm Design.

This repository contains a Python implementation of the Stable Marriage Algorithm, a mechanism for solving the stable marriage problem. The algorithm is widely used in the field of matching theory to find a stable matching between two sets of elements, such as job applicants and employers or medical students and residency programs.

Repository for my 4th year university individual project.

This repository contains the Gale-Shapley (1962) and Irving's (1985) algorithm's for Stable Matching.

Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model

For people who hate dating apps: one match a week, chosen by a fair stable-matching engine. Expo app, Hono API, Postgres.

A Multi Cloud Marketplace Model with Multiple Brokers for IaaS Layer and Generalized Stable Matching

Genetic algorithm in Java solving the Stable Matching (stable marriage) problem — college AI assignment, with bugs found and fixed

Autonomous Multi-Enterprise Co-Marketing, Dynamic Bundling & Cooperative Profit-Sharing Swarm. Uses Gale-Shapley stable matching and cooperative Shapley value game theory to engineer cross-ecosystem distribution alliances and fair revenue clearing.

Gale-Shapley algorithm

Gale-Shapley stable matching via NLP text similarity, with group-fairness diagnostics, on synthetic data (Python).

Refined the Gale-Shapley algorithm by recalculating stable matchings in bipartite graphs, incorporating dynamic updates for edge deletions, achieving O(N) time complexity for edge deletions, enhancing computational efficiency.

An extension of the stable marriages problem which implements a novel algorithm that I created. The algorithms finds the optimum invigilation schedule that satisfies a group of n teachers (or other individuals) that must proctor m exams.

Exploring different methods & algorithms, practicing fundamental techniques and terms of algorithm design domain