5995 search results - page 379 / 1199 » Algorithmic Game Theory |
167
click to vote
ATAL
2003
Springer
16 years 2 days ago
2003
Springer
This paper studies argumentation-based dialogues between agents. It takes a previously defined system by which agents can trade arguments and examines the outcomes of the dialogu...
162
click to vote
BIRTHDAY
2003
Springer
16 years 2 days ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
190
click to vote
IFIP
1999
Springer
15 years 11 months ago
1999
Springer
This paper initiates a framework for improving product development processes. The starting point is the present gap between the theory of product and process models and their actu...
204
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
164
click to vote
ICDIM
2007
IEEE
15 years 10 months ago
2007
IEEE
In this position paper we analyze the benefits of enabling virtual communities to self-organize and introduce a novel research direction for providing incentives, required in this...