Sciweavers

402 search results - page 53 / 81
» Complexity of Decision Problems for Simple Regular Expressio...
Sort
View
ECAI
2010
Springer
13 years 9 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
CCS
2005
ACM
14 years 2 months ago
A framework for concrete reputation-systems with applications to history-based access control
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
Karl Krukow, Mogens Nielsen, Vladimiro Sassone
PLDI
2003
ACM
14 years 1 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
JOC
2007
93views more  JOC 2007»
13 years 8 months ago
Robust Information-Theoretic Private Information Retrieval
A Private Information Retrieval (PIR) protocol allows a user to retrieve a data item of its choice from a database, such that the servers storing the database do not gain informat...
Amos Beimel, Yoav Stahl
ATAL
2009
Springer
14 years 3 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge