Sciweavers

1615 search results - page 225 / 323
» Computer science and decision theory
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
FOCS
1994
IEEE
15 years 11 months ago
The Load, Capacity and Availability of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
Moni Naor, Avishai Wool
ATAL
2006
Springer
15 years 10 months ago
Failures of the VCG mechanism in combinatorial auctions and exchanges
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...
Vincent Conitzer, Tuomas Sandholm
CSR
2008
Springer
15 years 6 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
FC
2007
Springer
122views Cryptology» more  FC 2007»
16 years 1 months ago
Mental Models of Security Risks
1 2 There is a critical need in computer security to communicate risks and thereby enable informed decisions by naive users. Yet computer security has not been engaged with the sc...
Farzaneh Asgharpour, Debin Liu, L. Jean Camp