# AuctionAlgorithm

**Repository Path**: BigFootSnail/auction-algorithm

## Basic Information

- **Project Name**: AuctionAlgorithm
- **Description**: Auction Algorithm for Symmetric and Asymmetric Type of Assignment Problems
- **Primary Language**: Python
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2022-04-16
- **Last Updated**: 2022-04-16

## Categories & Tags

**Categories**: Uncategorized

**Tags**: AuctionAlgorithm

## README

# AuctionAlgorithm

#### 介绍

- Class name: AuctionAlgorithm
- Version: Auction Algorithm for Symmetric and Asymmetric Type of Assignment Problems
- Input: a matrix Aij
- Ouput: Two forms of Pairs_current for task allocation
- Citation: 
  - Algorithm Conforming to Chapter 7 of the book "Network Optimization: Continuous and Discrete Models" by Dimitri P. Bertsekas, Massachusetts Institute of Technology.
  - "A Forward Reverse Auction Algorithm for Asymmetric Assignment Problems," by D. P. Bertsekas and D. A. Castanon. Report LIDS-P-2159, Lab. for Information and Decision Systems, also Computational Optimization and Applications, Vol. 1, pp. 277-297, 1992.
- Notes: 
  - The "Forward Reverse Auction Algorithm" above deals with only the condition for na >= nt, which "ImproveAuctionAlgorithm" could deal with any condition.
  - Compared with Hungarian and All_permutation algorithm
- Usage: Create an object of class with input a matrix; then run method "EnterImproveAuctionAlgorithm" without anything
- Peng Wu, Apr 6, 2022
- Last modified: Apr 7, 2022
- Based on "https://github.com/nikhilsampangi/Auction-Algorithm"

#### 使用说明

1.  建立对象同时输入二维矩阵`AuctionAlgorithm(matri)`
2.  运用方法`EnterImproveAuctionAlgorithm()`
3.  返回两个多维列表，前者Pairs，后者布尔矩阵