There are p heterogeneous objects to be assigned to n competing agents (n > p)
each with unit demand. It is required to design a Groves mechanism for this assignment problem
s...
Abstract. Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforest...
We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and Vandewalle (Crypto'93) and later extensively analysed by Black, Rogaway and Sh...
This paper introduces time-tradeoff (TTO) sequences as a new tool to analyze time inconsistency and intertemporal choice. TTO sequences simplify the measurement of discount functio...
Arthur E. Attema, Han Bleichrodt, Kirsten I. M. Ro...
— Japan is known as an “earthquake country” and hence both companies and governments require an operation management method called BCM to ensure that operations and services ...