We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
We report on a series of highly controlled human subject experiments in networked bargaining. The basic interaction between two players is the decision of how to share a mutual pa...
Tanmoy Chakraborty, J. Stephen Judd, Michael Kearn...
Once the decision to outsource an activity has been made, managers are faced with issues related to the management of the relationship with their service providers. A critical ele...
Benoit Aubert, Jean-Francois Houde, Michel Patry, ...
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
This paper describes research on the perception of undergraduate students of the concept of reduction. Specifically, based on an analysis of students' answers to questions ad...