| Presentation | 2017-05-13 λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In the obnoxious facility game, we design mechanisms that output a location of an undesirable facility based on the locations of players reported by themselves. The benefit of a player is defined to be the distance between her location and the facility. A player may try to manipulate the output of the mechanism by strategically misreporting her location. We wish to design a $lambda$-group strategy-proof mechanism i.e., for every group of players, at least one player in the group cannot gain strictly more than $lambda$ times her primary benefit by having the entire group change their reports simultaneously. In this paper, we design an $k$-candidate $lambda$-group strategy-proof mechanism for the obnoxious facility game in the metric defined by $k$ half lines with a common endpoint such that each candidate is a point in each of the half-lines at the same distance to the common endpoint as other candidates. Then, we show that the benefit ratio of the mechanism is at most $1+1/(k-1)lambda$. Finally, we prove that the bound is nearly tight. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | mechanism designobnoxious facility gamestrategy proofstar network |
| Paper # | COMP2017-9 |
| Date of Issue | 2017-05-05 (COMP) |
| Conference Information | |
| Committee | COMP / IPSJ-AL |
|---|---|
| Conference Date | 2017/5/12(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Hiro Ito(Univ. of Electro-Comm.) / 堀山 貴史(埼玉大) |
| Vice Chair | Yushi Uno(Osaka Pref. Univ.) |
| Secretary | Yushi Uno(Seikei Univ.) / (Kyushu Inst. of Tech.) |
| Assistant | |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing / Special Interest Group on Algorithms |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks |
| Sub Title (in English) | |
| Keyword(1) | mechanism designobnoxious facility gamestrategy proofstar network |
| 1st Author's Name | Yuhei Fukui |
| 1st Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 2nd Author's Name | Aleksandar Shurbevski |
| 2nd Author's Affiliation | Kyoto University(Kyoto Univ.) |
| 3rd Author's Name | Hiroshi Nagamochi |
| 3rd Author's Affiliation | Kyoto University(Kyoto Univ.) |
| Date | 2017-05-13 |
| Paper # | COMP2017-9 |
| Volume (vol) | vol.117 |
| Number (no) | COMP-28 |
| Page | pp.pp.61-68(COMP), |
| #Pages | 8 |
| Date of Issue | 2017-05-05 (COMP) |