论文信息 - Walking in circles

Walking in circles

Consider the unit circle S^1 with distance function d measured along the circle. We show that for every selection of 2n points x"1,...,x"n,y"1,...,y"[email protected]?S^1 there exists [email protected]?{1,...,n} such that @?"k"="1^nd(x"i,x"k)@[email protected]?"k"="1^nd(x"i,y"k). We also discuss a game theoretic interpretation of this result.

Noga Alon | Moshe Tennenholtz | Ariel D. Procaccia | Michal Feldman

[1] Noga Alon,et al. Strategyproof Approximation Mechanisms for Location on Networks , 2009, ArXiv.

[2] Rakesh V. Vohra,et al. Strategy-proof Location on a Network , 2002, J. Econ. Theory.

[3] Noga Alon,et al. Strategyproof Approximation of the Minimax on Networks , 2010, Math. Oper. Res..