{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T07:46:12Z","timestamp":1777535172108,"version":"3.51.4"},"reference-count":12,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Generalized knockout tournament seedings for an arbitrary number of participants in one match are designed. Several properties of knockout tournament seedings are investigated. Enumeration results for knockout tournament seedings with different properties are obtained. Several new generalized knockout tournaments seedings are proposed and justified by a set of properties.<\/jats:p>","DOI":"10.2478\/ijcss-2018-0006","type":"journal-article","created":{"date-parts":[[2019,1,9]],"date-time":"2019-01-09T04:33:23Z","timestamp":1547008403000},"page":"113-127","source":"Crossref","is-referenced-by-count":11,"title":["Generalized Knockout Tournament Seedings"],"prefix":"10.2478","volume":"17","author":[{"given":"A.","family":"Karpov","sequence":"first","affiliation":[{"name":"National Research University Higher School of Economics , Moscow , Russia"},{"name":"Institute of Control Sciences of Russian Academy of Sciences , Moscow , Russia"}]}],"member":"374","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"2026042808562232907_j_ijcss-2018-0006_ref_001_w2aab3b7b1b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"Dagaev, D., & Sonin, K. (2018). Winning by losing: Incentive incompatibility in multiple qualifiers. Journal of Sports Economics, 19(8), 1122-1146.10.1177\/1527002517704022","DOI":"10.1177\/1527002517704022"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_002_w2aab3b7b1b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"Dagaev, D., & Suzdaltsev, A. (2018). Competitive intensity and quality maximizing seedings in knock-out tournaments. Journal of Combinatorial Optimization, 35(1), 170\u2013188.10.1007\/s10878-017-0164-7","DOI":"10.1007\/s10878-017-0164-7"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_003_w2aab3b7b1b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"Groh, C., Moldovanu, B., Sela, A., & Sunde, U. (2012). Optimal seedings in elimination tournaments. Economic Theory, 49(1), 59\u201380.10.1007\/s00199-008-0356-6","DOI":"10.1007\/s00199-008-0356-6"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_004_w2aab3b7b1b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"Karpov, A. (2016). A new knockout tournament seeding method and its axiomatic justification. Operations Research Letters, 44(6), 706-711.10.1016\/j.orl.2016.09.003","DOI":"10.1016\/j.orl.2016.09.003"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_005_w2aab3b7b1b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"Kr\u00e4kel, M. (2014). Optimal seedings in elimination tournaments revisited. Economic Theory Bulletin, 2(1), 77\u201391.10.1007\/s40505-014-0030-z","DOI":"10.1007\/s40505-014-0030-z"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_006_w2aab3b7b1b1b6b1ab1ab6Aa","unstructured":"OEIS. The On-Line Encyclopedia of Integer Sequences. Published electronically at http:\/\/oeis.org"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_007_w2aab3b7b1b1b6b1ab1ab7Aa","unstructured":"Rosen, S. (1986). Prizes and incentives in elimination tournaments. American Economic Review, 76(4), 701\u2013715.10.3386\/w1668"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_008_w2aab3b7b1b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"Schwenk, A.J. (2000). What is the Correct Way to Seed a Knockout Tournament? The American Mathematical Monthly, 107(2), 140-150.10.1080\/00029890.2000.12005171","DOI":"10.1080\/00029890.2000.12005171"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_009_w2aab3b7b1b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"Stracke, R., H\u00f6chtl, W., Kerschbamer R., & Sunde U. (2015). Incentives and selection in promotion contests: Is it possible to kill two birds with one stone? Managerial and Decision Economics, 36(5), 275\u2013285.10.1002\/mde.2666","DOI":"10.1002\/mde.2666"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_010_w2aab3b7b1b1b6b1ab1ac10Aa","unstructured":"Vassilevska Williams, V. (2016). Knockout Tournaments. In H. Moulin, F. Brandt, V. Conitzer, U. Endriss, J. Lang, A. Procaccia (Eds.), Handbook of Computational Social Choice (pp. 453-474). Cambridge: Cambridge University Press. doi:10.1017\/CBO9781107446984.02010.1017\/CBO9781107446984.020"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_011_w2aab3b7b1b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"Wei, G., Bary, B., & Qin, Y. (2018). Sorted or pooled? Optimal tournament design for heterogeneous contestants. Cluster Computing, 1-8. doi: 10.1007\/s10586-018-1714-110.1007\/s10586-018-1714-1","DOI":"10.1007\/s10586-018-1714-1"},{"key":"2026042808562232907_j_ijcss-2018-0006_ref_012_w2aab3b7b1b1b6b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"Wright, M. (2014). OR analysis of sporting rules \u2013 A survey. European Journal of Operational Research, 232(1), 1\u20138.10.1016\/j.ejor.2013.03.043","DOI":"10.1016\/j.ejor.2013.03.043"}],"container-title":["International Journal of Computer Science in Sport"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/ijcss\/17\/2\/article-p113.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/reference-global.com\/pdf\/10.2478\/ijcss-2018-0006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:58:18Z","timestamp":1777395498000},"score":1,"resource":{"primary":{"URL":"https:\/\/reference-global.com\/article\/10.2478\/ijcss-2018-0006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":12,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,12,31]]},"published-print":{"date-parts":[[2018,12,1]]}},"alternative-id":["10.2478\/ijcss-2018-0006"],"URL":"https:\/\/doi.org\/10.2478\/ijcss-2018-0006","relation":{},"ISSN":["1684-4769"],"issn-type":[{"value":"1684-4769","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]}}}