26 search results - page 2 / 6 » Realising Common Knowledge Assumptions in Agent Auctions |
WINE
2010
Springer
13 years 3 months ago
2010
Springer
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
ARGMAS
2008
Springer
13 years 7 months ago
2008
Springer
Intelligent and autonomous software agents may engage in dialogue and argument with one another, and much recent research has considered protocols, architectures and frameworks for...
AAAI
2010
13 years 7 months ago
2010
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...
AAAI
2007
13 years 8 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
ICMAS
2000
13 years 7 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...