Verifiably Truthful Mechanisms-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Verifiably Truthful Mechanisms

Published:2015-01-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science
language:
Short-container-title:

Author:

Brânzei Simina¹,Procaccia Ariel D.²

Affiliation:

1. University of Aarhus, Aarhus, Denmark

2. Carnegie Mellon University, Pittsburgh, USA

Funder

Danish National Research Foundation

National Science Foundation of China

US National Science Foundation

Danish Strategic Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2688073.2688098

Reference32 articles.

1. Strategyproof Approximation of the Minimax on Networks

2. Sum of us

3. Time bounds for selection

4. Verifying Multi-agent Programs by Model Checking

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Obvious Strategyproofness, Bounded Rationality and Approximation;Theory of Computing Systems;2022-04-25

2. From Monetary to Nonmonetary Mechanism Design via Artificial Currencies;Mathematics of Operations Research;2021-08

3. Facility location games with optional preference;Theoretical Computer Science;2020-12

4. Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location;Algorithmica;2020-10-03

5. From Monetary to Non-Monetary Mechanism Design via Artificial Currencies;SSRN Electronic Journal;2017

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP