3240 search results - page 471 / 648 » Pre-aggregation with probability distributions |
166
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We study information elicitation mechanisms in which a principal agent attempts to elicit the private information of other agents using a carefully selected payment scheme based o...
183
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
186
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
184
Voted
PODC
1995
ACM
15 years 10 months ago
1995
ACM
We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms ...
212
click to vote
ICPP
1991
IEEE
15 years 10 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...