14 research outputs found
An Exercise in Tournament Design: When Some Matches Must Be Scheduled
Single-elimination (SE) tournaments are a popular format used in competitive
environments and decision making. Algorithms for SE tournament manipulation
have been an active topic of research in recent years. In this paper, we
initiate the algorithmic study of a novel variant of SE tournament manipulation
that aims to model the fact that certain matchups are highly desired in a
sporting context, incentivizing an organizer to manipulate the bracket to make
such matchups take place. We obtain both hardness and tractability results. We
show that while the problem of computing a bracket enforcing a given set of
matches in an SE tournament is NP-hard, there are natural restrictions that
lead to polynomial-time solvability. In particular, we show polynomial-time
solvability if there is a linear ordering on the ability of players with only a
constant number of exceptions where a player with lower ability beats a player
with higher ability.Comment: Full version of AAAI 2024 pape
Exploring Subexponential Parameterized Complexity of Completion Problems
Let be a family of graphs. In the -Completion problem,
we are given a graph and an integer as input, and asked whether at most
edges can be added to so that the resulting graph does not contain a
graph from as an induced subgraph. It appeared recently that special
cases of -Completion, the problem of completing into a chordal graph
known as Minimum Fill-in, corresponding to the case of , and the problem of completing into a split graph,
i.e., the case of , are solvable in parameterized
subexponential time . The exploration of this
phenomenon is the main motivation for our research on -Completion.
In this paper we prove that completions into several well studied classes of
graphs without long induced cycles also admit parameterized subexponential time
algorithms by showing that:
- The problem Trivially Perfect Completion is solvable in parameterized
subexponential time , that is -Completion for , a cycle and a path on four
vertices.
- The problems known in the literature as Pseudosplit Completion, the case
where , and Threshold Completion, where , are also solvable in time .
We complement our algorithms for -Completion with the following
lower bounds:
- For , , , and
, -Completion cannot be solved in time
unless the Exponential Time Hypothesis (ETH) fails.
Our upper and lower bounds provide a complete picture of the subexponential
parameterized complexity of -Completion problems for .Comment: 32 pages, 16 figures, A preliminary version of this paper appeared in
the proceedings of STACS'1
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
Ordering Transactions with Bounded Unfairness: Definitions, Complexity and Constructions
An important consideration in the context of distributed ledger protocols is fairness in terms of transaction ordering. Recent work [Crypto 2020] revealed a deep connection of (receiver) order fairness to social choice theory and related impossibility results arising from the Condorcet paradox. As a result of the impossibility, various relaxations of order fairness were investigated in prior works. Given that distributed ledger protocols, especially those processing smart contracts, must serialize the input transactions, a natural objective is to minimize the distance (in terms of injected number of transactions) between any pair of unfairly ordered transactions in the output ledger — a concept we call bounded unfairness. In state machine replication (SMR) parlance this asks for minimizing the number of unfair state updates occurring before the processing of any transaction. This unfairness minimization objective gives rise to a natural class of parametric order fairness definitions that has not been studied before. As we observe, previous realizable relaxations of order fairness do not yield good unfairness bounds.
Achieving optimal order fairness in the sense of bounded unfairness turns out to be connected to the graph theoretic properties of the underlying transaction dependency graph and specifically the bandwidth metric of strongly connected components in this graph. This gives rise to a specific instance of the definition that we call ``directed bandwidth order-fairness\u27\u27 which we show that it captures the best possible that any protocol can achieve in terms of bounding unfairness. We prove ordering transactions in this fashion is NP-hard and non-approximable for any constant ratio. Towards realizing the property, we put forth a new distributed ledger protocol called Taxis that achieves directed bandwidth order-fairness in the permissionless setting. We present two variants of our protocol, one that matches the property perfectly but (necessarily) lacks in performance and liveness, and a second variant that achieves liveness and better complexity while offering a slightly relaxed version of the directed bandwidth definition. Finally, we comment on applications of our work to social choice theory, a direction which we believe to be of independent interest
On interval number in cycle convexity
International audienceRecently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they presented some of its applications in Knot theory. Roughly, the tunnel number of a knot embedded in a plane is upper bounded by the hull number of a corresponding planar 4-regular graph in cycle convexity. In this paper, we go further in the study of this new graph convexity and we study the interval number of a graph in cycle convexity. This parameter is, alongside the hull number, one of the most studied parameters in the literature about graph convexities. Precisely, given a graph G, its interval number in cycle convexity, denoted by , is the minimum cardinality of a set S ⊆ V (G) such that every vertex w ∈ V (G) \ S has two distinct neighbors u, v ∈ S such that u and v lie in same connected component of G[S], i.e. the subgraph of G induced by the vertices in S.In this work, first we provide bounds on and its relations to other graph convexity parameters, and explore its behavior on grids. Then, we present some hardness results by showing that deciding whether ≤ k is NP-complete, even if G is a split graph or a bounded-degree planar graph, and that the problem is W[2]-hard in bipartite graphs when k is the parameter. As a consequence, we obtainthat cannot be approximated up to a constant factor in the classes of split graphs and bipartite graphs (unless P = N P ).On the positive side, we present polynomial-time algorithms to compute for outerplanar graphs, cobipartite graphs and interval graphs. We also present fixed-parameter tractable (FPT) algorithms to compute it for (q, q − 4)-graphs when q is the parameter and for general graphs G when parameterized either by the treewidth or the neighborhood diversity of G.Some of our hardness results and positive results are not known to hold for related graph convexities and domination problems. We hope that the design of our new reductions and polynomial-time algorithms can be helpful in order to advance in the study of related graph problems
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum