resources
An Empirical Analysis of Approximation Algorithms for
Euclidean TSP
C++ TSP-Arora-Implementation
Graph manipulation
縮放graph把圖切成大小為 O(𝜖𝑑/8𝑘𝑛)(我會調的參數可以先隨便設) 的方格
縮放每一個小方格的邊長為8
把點round到方格點上
peter10720129 changed a year agoView mode Like Bookmark
Expriment Setting
Each question will run 10000 ficious play
Each play has 10000 iteration
The initial strategy for each player will be randomly initilzed
The graph represent the result of each play
A1.
It will always converge to $(r_2,c_2)$.
All the plays converge to $(r_2,c_2)$
peter10720129 changed 2 years agoView mode Like Bookmark