We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...