Sciweavers

281 search results - page 6 / 57
» A revealed preference approach to computational complexity i...
Sort
View

Lecture Notes
357views
15 years 7 months ago
Computational Mechanism Design
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001. The focus of this chapter is on the Gen...
David Parkes
JUCS
2010
160views more  JUCS 2010»
13 years 6 months ago
LCP-Nets: A Linguistic Approach for Non-functional Preferences in a Semantic SOA Environment
Abstract: This paper addresses the problem of expressing preferences among nonfunctional properties of services in a Web service architecture. In such a context, semantic and non-f...
Pierre Châtel, Isis Truck, Jacques Malenfant
CORR
2002
Springer
159views Education» more  CORR 2002»
13 years 7 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm
CLIMA
2010
13 years 8 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
AGENTS
2000
Springer
14 years 3 days ago
Adaptive Trust and Co-operation: An Agent-Based Simulation Approach
This paper extends earlier work in the use of ‘Agent-based Computational Economics’ (ACE) for modelling the development of co-operation between firms. Inter-firm relations hav...
Bart Nooteboom, Tomas Klos, René J. Jorna