On succinct encodings for the tournament fixing problem

Sushmita Gupta; Saket Saurabh; Ramanujan Sridharan; Meirav Zehavi

doi:https://doi.org/10.24963/ijcai.2019/46

On succinct encodings for the tournament fixing problem

Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Single-elimination tournaments are a popular format in competitive environments. The Tournament Fixing Problem (TFP), which is the problem of finding a seeding of the players such that a certain player wins the resulting tournament, is known to be NP-hard in general and fixed-parameter tractable when parameterized by the feedback arc set number of the input tournament (an oriented complete graph) of expected wins/loses. However, the existence of polynomial kernelizations (efficient preprocessing) for TFP has remained open. In this paper, we present the first polynomial kernelization for TFP parameterized by the feedback arc set number of the input tournament. We achieve this by providing a polynomial-time routine that computes a SAT encoding where the number of clauses is bounded polynomially in the feedback arc set number.

Original language	American English
Title of host publication	Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Editors	Sarit Kraus
Pages	322-328
Number of pages	7
ISBN (Electronic)	9780999241141
DOIs	https://doi.org/10.24963/ijcai.2019/46
State	Published - 1 Jan 2019
Event	28th International Joint Conference on Artificial Intelligence, IJCAI 2019 - Macao, China Duration: 10 Aug 2019 → 16 Aug 2019

Publication series

Name	IJCAI International Joint Conference on Artificial Intelligence
Volume	2019-August

Conference

Conference	28th International Joint Conference on Artificial Intelligence, IJCAI 2019
Country/Territory	China
City	Macao
Period	10/08/19 → 16/08/19

All Science Journal Classification (ASJC) codes

Artificial Intelligence

Access to Document

https://doi.org/10.24963/ijcai.2019/46

Cite this

@inproceedings{40c4cf77e58d4a549ade3cac811b1bc3,

title = "On succinct encodings for the tournament fixing problem",

abstract = "Single-elimination tournaments are a popular format in competitive environments. The Tournament Fixing Problem (TFP), which is the problem of finding a seeding of the players such that a certain player wins the resulting tournament, is known to be NP-hard in general and fixed-parameter tractable when parameterized by the feedback arc set number of the input tournament (an oriented complete graph) of expected wins/loses. However, the existence of polynomial kernelizations (efficient preprocessing) for TFP has remained open. In this paper, we present the first polynomial kernelization for TFP parameterized by the feedback arc set number of the input tournament. We achieve this by providing a polynomial-time routine that computes a SAT encoding where the number of clauses is bounded polynomially in the feedback arc set number.",

author = "Sushmita Gupta and Saket Saurabh and Ramanujan Sridharan and Meirav Zehavi",

note = "Publisher Copyright: {\textcopyright} 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.; 28th International Joint Conference on Artificial Intelligence, IJCAI 2019 ; Conference date: 10-08-2019 Through 16-08-2019",

year = "2019",

month = jan,

day = "1",

doi = "https://doi.org/10.24963/ijcai.2019/46",

language = "American English",

series = "IJCAI International Joint Conference on Artificial Intelligence",

pages = "322--328",

editor = "Sarit Kraus",

booktitle = "Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019",

}

Gupta, S, Saurabh, S, Sridharan, R & Zehavi, M 2019, On succinct encodings for the tournament fixing problem. in S Kraus (ed.), Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. IJCAI International Joint Conference on Artificial Intelligence, vol. 2019-August, pp. 322-328, 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10/08/19. https://doi.org/10.24963/ijcai.2019/46

On succinct encodings for the tournament fixing problem. / Gupta, Sushmita; Saurabh, Saket; Sridharan, Ramanujan et al.
Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019. ed. / Sarit Kraus. 2019. p. 322-328 (IJCAI International Joint Conference on Artificial Intelligence; Vol. 2019-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On succinct encodings for the tournament fixing problem

AU - Gupta, Sushmita

AU - Saurabh, Saket

AU - Sridharan, Ramanujan

AU - Zehavi, Meirav

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Single-elimination tournaments are a popular format in competitive environments. The Tournament Fixing Problem (TFP), which is the problem of finding a seeding of the players such that a certain player wins the resulting tournament, is known to be NP-hard in general and fixed-parameter tractable when parameterized by the feedback arc set number of the input tournament (an oriented complete graph) of expected wins/loses. However, the existence of polynomial kernelizations (efficient preprocessing) for TFP has remained open. In this paper, we present the first polynomial kernelization for TFP parameterized by the feedback arc set number of the input tournament. We achieve this by providing a polynomial-time routine that computes a SAT encoding where the number of clauses is bounded polynomially in the feedback arc set number.

AB - Single-elimination tournaments are a popular format in competitive environments. The Tournament Fixing Problem (TFP), which is the problem of finding a seeding of the players such that a certain player wins the resulting tournament, is known to be NP-hard in general and fixed-parameter tractable when parameterized by the feedback arc set number of the input tournament (an oriented complete graph) of expected wins/loses. However, the existence of polynomial kernelizations (efficient preprocessing) for TFP has remained open. In this paper, we present the first polynomial kernelization for TFP parameterized by the feedback arc set number of the input tournament. We achieve this by providing a polynomial-time routine that computes a SAT encoding where the number of clauses is bounded polynomially in the feedback arc set number.

UR - http://www.scopus.com/inward/record.url?scp=85074923768&partnerID=8YFLogxK

U2 - https://doi.org/10.24963/ijcai.2019/46

DO - https://doi.org/10.24963/ijcai.2019/46

M3 - Conference contribution

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 322

EP - 328

BT - Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019

A2 - Kraus, Sarit

T2 - 28th International Joint Conference on Artificial Intelligence, IJCAI 2019

Y2 - 10 August 2019 through 16 August 2019

ER -

On succinct encodings for the tournament fixing problem

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this