7 papers
Solution Space Partitioning for Extremal Set Theory
Jesse Looney, Jonah McDonald, Allison Klingler +3
We present a method for partitioning the solution space of statements in extremal set theory. Compared with domain-agnostic partitioning methods like look-ahead, we perform case an…
Satisfiability Modulo Theories for Verifying MILP Certificates
Kenan Wood, Runtian Zhou, Haoze Wu +2
Correctness of results from mixed-integer linear programming (MILP) solvers is critical, particularly in the context of applications such as hardware verification, compiler optimiz…
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
Thomas R. Cameron, Jonad Pulaj
Zero forcing is a binary coloring game on a graph where a set of filled vertices can force non-filled vertices to become filled following a color change rule. In 2008, the zero for…
Bilevel Programming for Pebbling Numbers of Lemke Graph Products
Jonad Pulaj, Kenan Wood, Carl Yerger
Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacen…
Distributed Agreement in the Arrovian Framework
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
Preference aggregation is a fundamental problem in voting theory, in which public input rankings of a set of alternatives (called preferences) must be aggregated into a single pref…
Optimal Multilevel Slashing for Blockchains
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a g…