359 search results - page 12 / 72 » On Complete Primitives for Fairness |
ALDT
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communic...
HICSS
2010
IEEE
13 years 4 months ago
2010
IEEE
This paper investigates the impact of the characteristics of information security policy (ISP) on an employee's security compliance in the workplace. Two factors were propose...
CCGRID
2007
IEEE
14 years 1 months ago
2007
IEEE
We study two problems directly resulting from organizational decentralization of the Grid. Firstly, the problem of fair scheduling in systems in which the grid scheduler has compl...