Content deleted Content added
Geysirhead (talk | contribs) new key for Category:Game theory: "+" using HotCat |
m Open access bot: doi added to citation with #oabot. |
||
Line 19:
| pages = 129–140
| title = Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99)
| year = 1999| isbn = 978-1581130676 | s2cid = 8316937 | doi-access = free}}</ref> drew the attention of the Theoretical Computer Science community to designing algorithms for selfish (strategic) users. As they claim in the abstract:
{{Quote|We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents’ interests are best served by behaving correctly.
| |||