Welfare maximization and truthfulness in mechanism design with ordinal preferences

Deeparnab Chakrabarty, Chaitanya Swamy
{"title":"Welfare maximization and truthfulness in mechanism design with ordinal preferences","authors":"Deeparnab Chakrabarty, Chaitanya Swamy","doi":"10.1145/2554797.2554810","DOIUrl":null,"url":null,"abstract":"In this paper, we study mechanism design problems in the ordinal setting wherein the preferences of agents are described by orderings over outcomes, as opposed to specific numerical values associated with them. This setting is relevant when agents can compare outcomes, but aren't able to evaluate precise utilities for them. Such a situation arises in diverse contexts including voting and matching markets. Our paper addresses two issues that arise in ordinal mechanism design. To design social welfare maximizing mechanisms, one needs to be able to quantitatively measure the welfare of an outcome which is not clear in the ordinal setting. Second, since the impossibility results of Gibbard and Satterthwaite [14, 25] force one to move to randomized mechanisms, one needs a more nuanced notion of truthfulness. We propose rank approximation as a metric for measuring the quality of an outcome, which allows us to evaluate mechanisms based on worst-case performance, and lex-truthfulness as a notion of truthfulness for randomized ordinal mechanisms. Lex-truthfulness is stronger than notions studied in the literature, and yet flexible enough to admit a rich class of mechanisms circumventing classical impossibility results. We demonstrate the usefulness of the above notions by devising lex-truthful mechanisms achieving good rank-approximation factors, both in the general ordinal setting, as well as structured settings such as (one-sided) matching markets, and its generalizations, matroid and scheduling markets.","PeriodicalId":382856,"journal":{"name":"Proceedings of the 5th conference on Innovations in theoretical computer science","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th conference on Innovations in theoretical computer science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2554797.2554810","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

Abstract

In this paper, we study mechanism design problems in the ordinal setting wherein the preferences of agents are described by orderings over outcomes, as opposed to specific numerical values associated with them. This setting is relevant when agents can compare outcomes, but aren't able to evaluate precise utilities for them. Such a situation arises in diverse contexts including voting and matching markets. Our paper addresses two issues that arise in ordinal mechanism design. To design social welfare maximizing mechanisms, one needs to be able to quantitatively measure the welfare of an outcome which is not clear in the ordinal setting. Second, since the impossibility results of Gibbard and Satterthwaite [14, 25] force one to move to randomized mechanisms, one needs a more nuanced notion of truthfulness. We propose rank approximation as a metric for measuring the quality of an outcome, which allows us to evaluate mechanisms based on worst-case performance, and lex-truthfulness as a notion of truthfulness for randomized ordinal mechanisms. Lex-truthfulness is stronger than notions studied in the literature, and yet flexible enough to admit a rich class of mechanisms circumventing classical impossibility results. We demonstrate the usefulness of the above notions by devising lex-truthful mechanisms achieving good rank-approximation factors, both in the general ordinal setting, as well as structured settings such as (one-sided) matching markets, and its generalizations, matroid and scheduling markets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有序偏好下机制设计的福利最大化与真实性
在本文中,我们研究了序数设置下的机制设计问题,其中代理的偏好是通过结果的排序来描述的,而不是与它们相关的特定数值。当代理可以比较结果,但不能评估它们的精确效用时,这个设置是相关的。这种情况出现在包括投票和匹配市场在内的多种背景下。我们的论文解决了在有序机制设计中出现的两个问题。为了设计社会福利最大化机制,人们需要能够定量地衡量在有序设置中不明确的结果的福利。其次,由于Gibbard和Satterthwaite[14,25]的不可能结果迫使人们转向随机机制,人们需要一个更微妙的真实性概念。我们提出秩近似作为衡量结果质量的度量,这使我们能够基于最坏情况的性能来评估机制,并将lex-truthfulness作为随机有序机制的真实性概念。Lex-truthfulness比文献中研究的概念更强大,但也足够灵活,可以允许一种丰富的机制来规避经典的不可能结果。我们通过设计词汇真实机制来证明上述概念的有用性,无论是在一般有序设置中,还是在(片面)匹配市场等结构化设置中,以及它的推广,矩阵和调度市场中,都能实现良好的秩近似因子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the automorphism groups of strongly regular graphs I Coordination mechanisms from (almost) all scheduling policies Session details: Session 10: 10:30--10:40 Cryptogenography Rational arguments: single round delegation with sublinear verification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1