2 citations · 3 across the 6 of their papers we have counts for
6 papers
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…
Expiring Assets in Automated Market Makers
Kenan Wood, Maurice Herlihy, Hammurabi Mendes +1
An automated market maker (AMM) is a state machine that manages pools of assets, allowing parties to buy and sell those assets according to a fixed mathematical formula. AMMs are t…
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…
Local Configurations in Union-Closed Families
Jonad Pulaj, Kenan Wood
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets containing some nonempty set, there is some element in the groun…