supreethmv/BILP-Q

This repository contains the code to reproduce the results presented in the paper BILP-Q: Quantum Coalition Structure Generation

21
/ 100
Experimental

This project helps researchers and practitioners in cooperative game theory to determine the most effective ways for groups of agents to form coalitions. It takes as input various distributions of coalition values and identifies the best coalition structures, outputting a detailed analysis of the optimal solutions and the performance of different computational methods. The target users are researchers and advanced students in fields like economics, operations research, and artificial intelligence who are exploring quantum computing applications for combinatorial optimization.

No commits in the last 6 months.

Use this if you are a researcher investigating quantum approaches to solve the Coalition Structure Generation problem and want to compare quantum algorithms against classical baselines.

Not ideal if you need a solution for large-scale, real-world coalition formation problems or if you are not familiar with quantum computing concepts and environments like IBM Qiskit or D-Wave.

cooperative-game-theory coalition-formation quantum-optimization combinatorial-optimization computational-economics
Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 5 / 25
Maturity 16 / 25
Community 0 / 25

How are scores calculated?

Stars

12

Forks

Language

Jupyter Notebook

License

LGPL-2.1

Last pushed

Apr 19, 2022

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/supreethmv/BILP-Q"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.