Sciweavers

9888 search results - page 1635 / 1978
» compute 2009
Sort
View
RWEB
2009
Springer
16 years 1 months ago
Description Logics
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
Franz Baader
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
16 years 1 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
16 years 1 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
16 years 1 months ago
Doing Good with Spam Is Hard
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
Martin Hoefer, Lars Olbrich, Alexander Skopalik
SAGT
2009
Springer
192views Game Theory» more  SAGT 2009»
16 years 1 months ago
Better with Byzantine: Manipulation-Optimal Mechanisms
Abstract. A mechanism is manipulable if it is in some agents’ best interest to misrepresent their private information. The revelation principle establishes that, roughly, anythin...
Abraham Othman, Tuomas Sandholm
« Prev « First page 1635 / 1978 Last » Next »