Implementability of social choice functions
Algorithmic mechanism design is concerned with designing algorithms that implement a desired outcome-selecting function (called a social choice function), while taking into account the participating agents' selfish behavior. This work concentrates on a general and fundamental question of this...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/55608 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-55608 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-556082023-02-28T23:36:29Z Implementability of social choice functions Yu, Lan School of Physical and Mathematical Sciences Edith Elkind DRNTU::Science::Mathematics::Applied mathematics::Game theory DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity Algorithmic mechanism design is concerned with designing algorithms that implement a desired outcome-selecting function (called a social choice function), while taking into account the participating agents' selfish behavior. This work concentrates on a general and fundamental question of this field: which social choice functions are implementable? A truthful implementation incentivizes all agents to report their preferences truthfully. In the standard model of mechanism design, the renowned Revelation Principle implies that implementability equals truthful implementability. Towards obtaining useful characterizations of truthful social choice functions, this work includes two contributions. First, we prove the conjecture that weak monotonicity is sufficient for truthfulness for functions defined on a convex domain. The other characterization deals with the domain defined by one-dimensional single facility location game. The set of implementable functions is enriched when we allow assumptions on the center's ability to verify agents' inputs. Verification models give rise to non-truthful implementations and the set of truthfully implementable functions may also be enlarged. We discover inherent limitations of the existing partial verification model and propose the probabilistic verification model. In this model, a lie may be caught with certain probability; and if no lie is safe, every social choice function is truthfully implementable. We also investigate non-truthful implementations and optimal implementations that minimize center's expected payment. Doctor of Philosophy (SPMS) 2014-03-17T12:42:52Z 2014-03-17T12:42:52Z 2013 2013 Thesis http://hdl.handle.net/10356/55608 en 159 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Science::Mathematics::Applied mathematics::Game theory DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity |
spellingShingle |
DRNTU::Science::Mathematics::Applied mathematics::Game theory DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity Yu, Lan Implementability of social choice functions |
description |
Algorithmic mechanism design is concerned with designing algorithms that implement a desired outcome-selecting function (called a social choice function), while taking into account the participating agents' selfish behavior. This work concentrates on a general and fundamental question of this field: which social choice functions are implementable?
A truthful implementation incentivizes all agents to report their preferences truthfully. In the standard model of mechanism design, the renowned Revelation Principle implies that implementability equals truthful implementability. Towards obtaining useful characterizations of truthful social choice functions, this work includes two contributions. First, we prove the conjecture that weak monotonicity is sufficient for truthfulness for functions defined on a convex domain. The other characterization deals with the domain defined by one-dimensional single facility location game.
The set of implementable functions is enriched when we allow assumptions on the center's ability to verify agents' inputs. Verification models give rise to non-truthful implementations and the set of truthfully implementable functions may also be enlarged. We discover inherent limitations of the existing partial verification model and propose the probabilistic verification model. In this model, a lie may be caught with certain probability; and if no lie is safe, every social choice function is truthfully implementable. We also investigate non-truthful implementations and optimal implementations that minimize center's expected payment. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Yu, Lan |
format |
Theses and Dissertations |
author |
Yu, Lan |
author_sort |
Yu, Lan |
title |
Implementability of social choice functions |
title_short |
Implementability of social choice functions |
title_full |
Implementability of social choice functions |
title_fullStr |
Implementability of social choice functions |
title_full_unstemmed |
Implementability of social choice functions |
title_sort |
implementability of social choice functions |
publishDate |
2014 |
url |
http://hdl.handle.net/10356/55608 |
_version_ |
1759853960160608256 |