Skip to content

Latest commit

 

History

History
38 lines (25 loc) · 1.21 KB

README.md

File metadata and controls

38 lines (25 loc) · 1.21 KB
Raw

Replica-AUCB: Auction-Based Combinatorial Multi-Armed Bandit Mechanisms with Strategic Arms

Developed and tested on Apple M1, macOS 13.5.2 (22G91).

Overview

This repository houses the Python implementation of the Auction-Based Combinatorial Multi-Armed Bandit (AUCB) algorithms, which is based on the work presented in the following paper:

@inproceedings{gao2021auction,
  title={Auction-based combinatorial multi-armed bandit mechanisms with strategic arms},
  author={Gao, Guoju and Huang, He and Xiao, Mingjun and Wu, Jie and Sun, Yu-E and Zhang, Sheng},
  booktitle={IEEE INFOCOM 2021-IEEE Conference on Computer Communications},
  pages={1--10},
  year={2021},
  organization={IEEE}
}

Our codebase seeks to faithfully replicate the algorithms and experiments documented, thereby enabling verification of the paper's claims.

Experimental Results

The replicated experimental results are illustrated in the figure below:

Replicated Experimental Results

Issues

For bugs, questions, or discussions, please use the issues section of this repository.

Contributions

We welcome contributions to enhance the accuracy of replication. Fork the repository, commit your changes, and make a pull request.