arXiv: Computer Science and Game Theory最新文献

Commitment on Volunteer Crowdsourcing Platforms: Implications for Growth and Engagement 志愿者众包平台的承诺:对增长和参与的影响

arXiv: Computer Science and Game Theory Pub Date : 2020-05-21 DOI: 10.2139/SSRN.3802628

Irene Lo, V. Manshadi, Scott Rodilitz, A. Shameli

{"title":"Commitment on Volunteer Crowdsourcing Platforms: Implications for Growth and Engagement","authors":"Irene Lo, V. Manshadi, Scott Rodilitz, A. Shameli","doi":"10.2139/SSRN.3802628","DOIUrl":"https://doi.org/10.2139/SSRN.3802628","url":null,"abstract":"Volunteer crowdsourcing platforms, such as food recovery organizations, match volunteers with tasks which are often recurring. To ensure completion of such tasks, platforms frequently use a commitment lever known as \"adoption.\" Despite being effective in reducing match uncertainty, high levels of adoption reduce match availability for volunteers which in turn can suppress future engagement. We study how platforms should balance these two opposing factors. Our research is motivated by a collaboration with Food Rescue U.S. (FRUS), a volunteer-based food recovery organization active in over 33 locations across the U.S. For platforms such as FRUS, success crucially depends on efficient volunteer utilization and engagement. Consequently, effectively utilizing non-monetary levers, such as adoption, is critical. Based on our analysis of fine-grained FRUS data, we develop a model for a repeated two-sided matching market consisting of tasks (prearranged donations) and volunteers. Our model incorporates the uncertainty in match compatibility as well as the negative impact of failing to match on future engagement. We study the platform's optimal policy for setting the adoption level to maximize the total discounted number of matches. Our analysis reveals that the optimal myopic policy is either full or no adoption. For sufficiently thick markets, we show that such a myopic policy is also optimal in the long run. In thinner markets, even though a static policy of full or no adoption can be suboptimal, we show it achieves a constant-factor approximation where the factor improves with market thickness. Using our analytical and empirical results, we revisit the current design of the FRUS platform and make location-specific policy recommendations. More broadly, our work sheds light on how other two-sided platforms can control the double-edged impacts that commitment levers have on growth and engagement.","PeriodicalId":369328,"journal":{"name":"arXiv: Computer Science and Game Theory","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127140350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Comparative Statics via Stochastic Orderings in a Two-Echelon Market with Upstream Demand Uncertainty 具有上游需求不确定性的两梯次市场随机排序比较静力学

arXiv: Computer Science and Game Theory Pub Date : 2018-03-09 DOI: 10.1007/978-3-030-00473-6_36

Constandina Koki, Stefanos Leonardos, C. Melolidakis

引用次数: 7

Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge 第十六届理性与知识理论会议论文集

arXiv: Computer Science and Game Theory Pub Date : 2017-07-25 DOI: 10.4204/EPTCS.251

J. Lang

引用次数: 2

Evolutionary Stable Strategies in Games with Fuzzy Payoffs 模糊收益博弈中的进化稳定策略

arXiv: Computer Science and Game Theory Pub Date : 2015-01-18 DOI: 10.37256/AIE.122020420

Haozhen Situ

引用次数: 0

Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification 第五届游戏、自动机、逻辑和形式验证国际研讨会论文集

arXiv: Computer Science and Game Theory Pub Date : 2014-08-23 DOI: 10.4204/EPTCS.161

A. Peron, C. Piazza

引用次数: 2

Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width 有界树和DAG宽度奇偶博弈的时间和并行性结果

arXiv: Computer Science and Game Theory Pub Date : 2011-12-01 DOI: 10.2168/LMCS-9(2:6)2013

John Fearnley, S. Schewe

{"title":"Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width","authors":"John Fearnley, S. Schewe","doi":"10.2168/LMCS-9(2:6)2013","DOIUrl":"https://doi.org/10.2168/LMCS-9(2:6)2013","url":null,"abstract":"Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph parameters are small. In this paper, we study parity games on graphs with bounded treewidth, and graphs with bounded DAG width. We show that parity games with bounded DAG width can be solved in O(n^(k+3) k^(k + 2) (d + 1)^(3k + 2)) time, where n, k, and d are the size, treewidth, and number of priorities in the parity game. This is an improvement over the previous best algorithm, given by Berwanger et al., which runs in n^O(k^2) time. We also show that, if a tree decomposition is provided, then parity games with bounded treewidth can be solved in O(n k^(k + 5) (d + 1)^(3k + 5)) time. This improves over previous best algorithm, given by Obdrzalek, which runs in O(n d^(2(k+1)^2)) time. Our techniques can also be adapted to show that the problem of solving parity games with bounded treewidth lies in the complexity class NC^2, which is the class of problems that can be efficiently parallelized. This is in stark contrast to the general parity game problem, which is known to be P-hard, and thus unlikely to be contained in NC.","PeriodicalId":369328,"journal":{"name":"arXiv: Computer Science and Game Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131843725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Proceedings Second International Workshop on Interactions, Games and Protocols 第二届互动、游戏和协议国际研讨会论文集

arXiv: Computer Science and Game Theory Pub Date : 2011-02-18 DOI: 10.4204/EPTCS.50

J. Reich, B. Finkbeiner

{"title":"Proceedings Second International Workshop on Interactions, Games and Protocols","authors":"J. Reich, B. Finkbeiner","doi":"10.4204/EPTCS.50","DOIUrl":"https://doi.org/10.4204/EPTCS.50","url":null,"abstract":"The focus of the iWIGP workshop is the interrelation between interactions, games and protocols. How does computer science deal with nondeterministic interactions where the actions a system takes are not (completely) determined by the interactions the system is involved in? In computer science, nondeterministic interactions are usually described by protocols. However, these interactions can also be viewed as games. As to be expected, games have become an increasingly important modeling tool wherever nondeterministic interactions are involved -- from foundations in game semantics and reactive systems to applications in communication protocols and electronic business applications. The goal of this workshop has been to bring researchers from industry and academia together and to explore how a better understanding of the interrelation between interactions, games and protocols leads to better-designed and more reliable nondeterministic interacting systems. \u0000iWIGP 2011 was collocated with ETAPS 2011 in Saarbruecken, Germany. The programme consisted of three invited talks, by Kim Larsen, Marielle Stoelinga and Viktor Kuncak, and five refereed papers, selected by a strong programme committee of international reputation. The refereed papers are contained in this volume.","PeriodicalId":369328,"journal":{"name":"arXiv: Computer Science and Game Theory","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115448488","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0