Buscar
Mostrando ítems 1-10 de 537
Bribe-proof rules in the division problem
(Elsevier, 2007-11)
The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A ...
Towards secure distributed computations
(UR. FI – INCO., 2009)
In this paper, we present an infrastructure for securing distributed computations between hosts, using a novel technique called Proof Carrying Results. This technique is based on Necula's proof carrying code. Basically, ...
Standards of proof and human rights proceedingsESTÁNDARES DE PRUEBA Y JUICIOS POR VIOLACIONES A LOS DERECHOS HUMANOS
(Universidad Austral de Chile, Facultad de Ciencias Jurídicas y Sociales., 2009)
Chapter 25. Pre-breeding strategies
(Springer Nature, 2022)
A C-MEMS based electroosmotic microreactor for anisotropic AuNPs synthesis: Proof of concept
(Instituto Tecnológico y de Estudios Superiores de Monterrey, 2020-05-28)
Anisotropic gold nanoparticle synthesis has aroused great attention in the scientific community in the last two decades. These nanomaterials have unique properties that make them suitable for a wide range of applications ...
Existence of a competitive equilibrium when all goods are indivisible
(Universidad de Chile, Facultad de Economía y Negocios, 2015-05)
We study a production economy where all consumption goods are indivisible at the individual
level but perfectly divisible at the overall economy level. In order to facilitate the exchange in
this setting, we introduce a ...