Sciweavers

168 search results - page 19 / 34
» Matching as a non-cooperative game
Sort
View
HICSS
2007
IEEE
109views Biometrics» more  HICSS 2007»
15 years 4 months ago
Personality Matters: Incorporating Detailed User Attributes and Preferences into the Matchmaking Process
Finding ways of reducing undesired behavior in online interactions is at the forefront of the social computing research agenda. One promising way to reduce perceived “bad behavi...
Jens Riegelsberger, Scott Counts, Shelly Farnham, ...
LICS
1997
IEEE
15 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
77
Voted
IJCAI
2007
14 years 11 months ago
A Game-Theoretic Analysis of Strictly Competitive Multiagent Scenarios
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
AIA
2006
14 years 11 months ago
Some Semantics for a Logical Language for the Game of Dominoes
Epistemic logic allows to reason not only about situations, but also about the knowledge that a set of agents have about situations. In later years, epistemic logic has been appli...
Fernando R. Velázquez-Quesada, Francisco He...
61
Voted
JCIT
2010
106views more  JCIT 2010»
14 years 4 months ago
Clearing Policy for an Specialist Agent in Marketing Strategies
This work discusses clearing policy used by a specialist agent on marketing strategies under the rules of TAC CAT agents International Tournament. The goal of this agent is to cre...
Miriam Salcedo H., Darnes Vilarino A., Fabiola Lop...