The project is for the course "Game Theory and its Applications" at NCTU, TW.
It is a program that computes the set of winners and their payments for multiunit CA based on BRF-based greedy approach.
item.txt
- The numbers of items is recorded on the first line.
- The numbers of instance of each item is recorded on the second line.
5
3 2 2 2 2
player.txt
- The numbers of players ( Bidders ) is recorded on the first line.
- The name of each player is on the second line.
- The bid of each player is on the third line.
- The demand of each item of each player is the follow up.
5
P1 P2 P3 P4 P5
63 54 93 70 28
1 2 0 0 1
0 1 1 0 0
2 1 0 0 1
1 0 1 2 0
0 0 2 1 0
$ make
gcc -o BRF-based\ greedy\ approach BRF-based\ greedy\ approach.c; ./BRF-based\ greedy\ approach
Player Ranking:
P4 < P3 < P1 < P5 < P2
Winner Set:
{P2, P4, P5}
Allocated Result:
| P1 | P2 | P3 | P4 | P5
--------|-------|-------|-------|-------|-------
result | | win | | win | win
--------|-------|-------|-------|-------|-------
payment | | 0.00 | | 69.75 | 0.00