728 search results - page 139 / 146 » Bargaining with incomplete information |
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
PODC
1999
ACM
13 years 11 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
HICSS
1999
IEEE
13 years 11 months ago
1999
IEEE
The Technology Acceptance Model (TAM) represents an important theoretical contribution toward understanding IS usage and IS acceptance behaviors [6, 19]. However, as noted by seve...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
AAAI
2007
13 years 9 months ago
2007
Agents must form and update mental models about each other in a wide range of domains: team coordination, plan recognition, social simulation, user modeling, games of incomplete i...