Sciweavers

76 search results - page 2 / 16
» Mechanism design over discrete domains
Sort
View
AAAI
2010
13 years 7 months ago
Computationally Feasible Automated Mechanism Design: General Approach and Case Studies
In many multiagent settings, a decision must be made based on the preferences of multiple agents, and agents may lie about their preferences if this is to their benefit. In mechan...
Mingyu Guo, Vincent Conitzer
SOFSEM
2009
Springer
14 years 3 months ago
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
David C. Parkes
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
13 years 8 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
SLIP
2009
ACM
14 years 24 days ago
Honeycomb-structured computational interconnects and their scalable extension to spherical domains
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...
Joseph B. Cessna, Thomas R. Bewley
EDOC
2006
IEEE
14 years 10 days ago
Model Driven Design of Distribution Patterns for Web Service Compositions
Increasingly, distributed systems are being constructed by composing a number of discrete components. This practice, termed composition, is particularly prevalent within the Web s...
Ronan Barrett, Claus Pahl