36 citations · 171 across the 32 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.AC2021
Classifier construction in Boolean networks using algebraic methods
Robert Schwieger, Matías R. Bender, Heike Siebert +1
We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even mo…
math.CO2021
Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
Marie-Charlotte Brandenburg, Christian Haase, Ngoc Mai Tran
We show that a competitive equilibrium always exists in combinatorial auctions with anonymous graphical valuations and pricing, using discrete geometry. This is an intuitive and ea…