We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
Shuchi Chawla, Jason D. Hartline, Balasubramanian ...
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
The Wiener model is a versatile nonlinear block oriented model structure for miscellaneous applications. In this paper a method for identifying the parameters of such a model usin...
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...