{"type":"ScholarlyArticle","title":"Competition Among Contests: a Safety Level Analysis","authors":[{"name":"Ron Lavi","slug":"ron-lavi","given":"Ron","family":"Lavi","affiliation":"Technion -Israel Institute of Technology"},{"name":"Omer Shiran-Shvarzbard","slug":"omer-shiran-shvarzbard","given":"Omer","family":"Shiran-Shvarzbard","affiliation":"Technion -Israel Institute of Technology"}],"abstract":"We study a competition among two contests, where each contest designer aims to attract as much effort as possible. Such a competition exists in reality, e.g., in crowd-sourcing websites. Our results are phrased in terms of the ``relative prize power'' of a contest, which is the ratio of the total prize offered by this contest designer relative to the sum of total prizes of the two contests. When contestants have a quasi-linear utility function that captures\r\nboth a risk-aversion effect and a cost of effort, we show that a simple contest attracts a total effort which approaches the relative prize power of the contest designer assuming a large number of contestants. This holds regardless of the contest policy of the opponent, hence providing a ``safety level'' which is a robust notion similar in spirit to the max-min solution concept.","doi":"10.24963/ijcai.2020/53","url":"https://ijcai.org/proceedings/2020/53","pdf":"https://ijcai.org/proceedings/2020/0053.pdf","markdown":"https://ijcai.org/proceedings/2020/53.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/53","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":53,"pages":{"first":378,"last":385},"keywords":["Agent-based and Multi-agent Systems: Agent-Based Simulation and Emergence","Agent-based and Multi-agent Systems: Agent Theories and Models","Agent-based and Multi-agent Systems: Multi-agent Planning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24231/file_24231.m3u8","length_sec":279,"provider":"hls"}],"references":[{"position":1,"raw":"[Ahmadinejad et al., 2019] AmirMahdi Ahmadinejad, Sina Dehghani, MohammadTaghi Hajiaghayi, Brendan Lucier, Hamid Mahini, and Saeed Seddighin. From duels to bat- tlefields: Computing equilibria of blotto and other games. Mathematics of Operations Research, 2019.","title":"AmirMahdi Ahmadinejad","authors":"Ahmadinejad","year":"2019","venue":"Computing equilibria of blotto and other games","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Azmat and Möller, 2009] Ghazala Azmat and Marc Möller. Competition among contests. The RAND Journal of Eco- nomics, 40(4):743-768, 2009.","title":"Competition among contests","authors":"Möller Azmat, Ghazala Azmat, Marc Möller","year":"2009","venue":"The RAND Journal of Economics","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Azmat and Möller, 2018] Ghazala Azmat and Marc Möller. The distribution of talent across contests. The economic journal, 128(609):471-509, 2018.","title":"The distribution of talent across contests","authors":"Möller Azmat, Ghazala Azmat, Marc Möller","year":"2018","venue":"The economic journal","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Behnezhad et al., 2017] Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi HajiAghayi, and Saeed Seddighin. Faster and simpler algorithm for optimal strategies of blotto game. In Thirty-First AAAI Conference on Artificial Intelligence, 2017.","title":"Faster and simpler algorithm for optimal strategies of blotto game","authors":"Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammadtaghi Hajiaghayi, Saeed Seddighin","year":"2017","venue":"Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Corchón, 2007] Luis C Corchón. The theory of contests: a survey. Review of Economic Design, 11(2):69-100, 2007.","title":"The theory of contests: a survey","authors":"Luis C Corchón","year":"2007","venue":"Review of Economic Design","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[DiPalantino and Vojnovic, 2009] Dominic DiPalantino and Milan Vojnovic. Crowdsourcing and all-pay auctions. In Proceedings of the 10th ACM conference on Electronic commerce, pages 119-128. ACM, 2009.","title":"Dominic DiPalantino and Milan Vojnovic. Crowdsourcing and all-pay auctions","authors":"Vojnovic Dipalantino","year":"2009","venue":"Proceedings of the 10th ACM conference on Electronic commerce","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Feige et al., 2013] Uriel Feige, Ron Lavi, and Moshe Ten- nenholtz. Competition among asymmetric sellers with fixed supply. In EC, pages 415-416. Citeseer, 2013.","title":"Competition among asymmetric sellers with fixed supply","authors":"Uriel Feige, Ron Lavi, Moshe Tennenholtz","year":"2013","venue":"EC","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gao et al., 2012] Xi Alice Gao, Yoram Bachrach, Peter Key, and Thore Graepel. Quality expectation-variance tradeoffs in crowdsourcing contests. In Twenty-Sixth AAAI Confer- ence on Artificial Intelligence, 2012.","title":"Quality expectation-variance tradeoffs in crowdsourcing contests","authors":"Gao","year":"2012","venue":"Twenty-Sixth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kohli et al., 2011] Pushmeet Kohli, Yoram Bachrach, Thore Graepel, Gavin Smyth, Michael Armstrong, David Stillwell, Ralf Herbrich, and Michael Kearns. Behavioral game theory on online social networks: Colonel blotto is on facebook. Technical report, mimeo, 2011.","title":"Behavioral game theory on online social networks: Colonel blotto is on facebook","authors":"Kohli","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Łatek et al., 2009] Maciej Łatek, Robert Axtell, and Bogu- mil Kaminski. Bounded rationality via recursion. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems-Volume 1, pages 457-464. International Foundation for Autonomous Agents and Multiagent Systems, 2009.","title":"Bounded rationality via recursion","authors":"Maciej Łatek, Robert Axtell, Bogumil Kaminski","year":"2009","venue":"Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Levy and Sarne, 2018] Priel Levy and David Sarne. Under- standing over participation in simple contests. In Thirty- Second AAAI Conference on Artificial Intelligence, 2018.","title":"Understanding over participation in simple contests","authors":"Sarne ; Levy, Priel Levy, David Sarne","year":"2018","venue":"Thirty-Second AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Levy et al., 2017] Priel Levy, David Sarne, and Igor Rochlin. Contest design with uncertain performance and costly participation. In IJCAI, pages 302-309, 2017.","title":"Contest design with uncertain performance and costly participation","authors":"Priel Levy, David Sarne, Igor Rochlin","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/43"},{"position":13,"raw":"[Moldovanu and Sela, 2006] Benny Moldovanu and Aner Sela. Contest architecture. Journal of Economic Theory, 126(1):70-96, 2006.","title":"Benny Moldovanu and Aner Sela. Contest architecture","authors":"Sela Moldovanu","year":"2006","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Möller, 2012] Marc Möller. Incentives versus competitive balance. Economics Letters, 117(2):505-508, 2012.","title":"Incentives versus competitive balance","authors":"Marc Möller, Möller","year":"2012","venue":"Economics Letters","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Morgan et al., 2017] John Morgan, Dana Sisak, and Felix Várdy. The ponds dilemma. The Economic Journal, 128(611):1634-1682, 2017.","title":"The ponds dilemma","authors":"John Morgan, Dana Sisak, Felix Várdy","year":"2017","venue":"The Economic Journal","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Palmieri and Lallouet, 2017] Anthony Palmieri and Arnaud Lallouet. Constraint games revisited. 2017.","title":"Constraint games revisited","authors":"Anthony Palmieri, Arnaud Lallouet","year":"2017","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2017/101"},{"position":17,"raw":"[Segev, 2019] Ella Segev. Crowdsourcing contests. Euro- pean Journal of Operational Research, 2019.","title":"Crowdsourcing contests","authors":"Ella Segev, Segev","year":"2019","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Siegel, 2009] Ron Siegel. All-pay contests. Econometrica, 77(1):71-92, 2009.","title":"Ron Siegel. All-pay contests","authors":"Siegel","year":"2009","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Tennenholtz, 2002] Moshe Tennenholtz. Competitive safety analysis: Robust decision-making in multi-agent systems. Journal of Artificial Intelligence Research, 17:363-378, 2002.","title":"Moshe Tennenholtz. Competitive safety analysis: Robust decision-making in multi-agent systems","authors":"Tennenholtz","year":"2002","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Vu et al., 2018a] Dong Quan Vu, Patrick Loiseau, and Alonso Silva. Efficient computation of approximate equi- libria in discrete colonel blotto games. 2018.","title":"Efficient computation of approximate equilibria in discrete colonel blotto games","authors":"Vu","year":"2018","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2018/72"},{"position":21,"raw":"[Vu et al., 2018b] Dong Quan Vu, Patrick Loiseau, and Alonso Silva. A simple and efficient algorithm to com- pute epsilon-equilibria of discrete colonel blotto games: Epsilon-equilibria of discrete colonel blotto games. In Proceedings of the 17th International Conference on Au- tonomous Agents and MultiAgent Systems, pages 2115- 2117. International Foundation for Autonomous Agents and Multiagent Systems, 2018.","title":"A simple and efficient algorithm to compute epsilon-equilibria of discrete colonel blotto games: Epsilon-equilibria of discrete colonel blotto games","authors":"Vu","year":"2018","venue":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Xu and Larson, 2014] Haifeng Xu and Kate Larson. Im- proving the efficiency of crowdsourcing contests. In Pro- ceedings of the 2014 international conference on Au- tonomous agents and multi-agent systems, pages 461- 468. International Foundation for Autonomous Agents and Multiagent Systems, 2014.","title":"Improving the efficiency of crowdsourcing contests","authors":"Larson Xu, Haifeng Xu, Kate Larson","year":"2014","venue":"Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}