Skip to search formSkip to main contentSkip to account menu
Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations
This exciting and pioneering new overview of multiagent systems, which are online systems composed of multiple interacting intelligent agents, i.e., online trading, offers a newly seen computer…
View via Publisher
Fab: content-based, collaborative recommendation
TLDR
It is explained how a hybrid system can incorporate the advantages of both methods while inheriting the disadvantages of neither, and how the particular design of the Fab architecture brings two additional benefits.
View on ACM
Agent-Oriented Programming
  • Y. Shoham
  • Computer Science
    Artif. Intell.
  • 17 December 1992
View via Publisher
Introduction to Multi-Agent Systems
A propositional modal logic of time intervals
In certain areas of artificial intelligence there is need to represent continuous change and to make statements that are interpreted with respect to time intervals rather than time points. To this…
View on ACM
Towards a universal test suite for combinatorial auction algorithms
TLDR
This paper presents a suite of distribution families for generating realistic, economically motivated combinatorial bids in five broad real-world domains, and hopes that this work will yield many comments, criticisms and extensions, bringing the community closer to a universal combinatorsial auction test suite.
View on ACM
Truth revelation in approximately efficient combinatorial auctions
TLDR
It is shown that the GVA payment scheme does not provide for a truth revealing mechanism, and another scheme is introduced that does guarantee truthfulness for a restricted class of players.
View on ACM
Essentials of Game Theory: A Concise Multidisciplinary Introduction
TLDR
This introduction is just what a growing multidisciplinary audience needs: it is concise, authoritative, up to date, and clear on the important conceptual issues.
View via Publisher
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
TLDR
This work proposes two methods of overcoming apparent intractability in combinatorial auctions by structuring the search space so that a modified depth-first search usually avoids even considering allocations that contain conflicting bids.
View Paper
Marginal contribution nets: a compact representation scheme for coalitional games
TLDR
This representation scheme captures characteristics of the interactions among the agents in a natural and concise manner and develops efficient algorithms for two of the most important solution concepts, the Shapley value and the core, under this representation.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License