Sciweavers

131 search results - page 24 / 27
» Designing Auctions for Deliberative Agents
Sort
View
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
AAAI
2006
13 years 9 months ago
The Robot Intelligence Kernel
The Robot Intelligence Kernel (RIK) is a portable, reconfigurable suite of perceptual, behavioral, and cognitive capabilities that can be used across many different platforms, env...
David J. Bruemmer, Douglas A. Few, Miles C. Walton...
IJCAI
2001
13 years 9 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson
ICMAS
1998
13 years 8 months ago
Emergent Properties of a Market-based Digital Library with Strategic Agents
The University of Michigan Digital Library (UMDL) is an open system that allows third-parties to build and integrate their own profit-seeking agents into the marketplace of inform...
Sunju Park, Edmund H. Durfee, William P. Birmingha...
ATAL
2010
Springer
13 years 8 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer