Search
Now showing items 1-9 of 9
Optimizing Streaming Applications with Self-Interested Users using M-DPOP
(Universiteit van Amsterdam, 2006)
In this paper we deal with the problem of optimally placing a set of query operators in an overlay network. Each user is interested in performing a query on streaming data and each query has an associated set of in-network ...
Optimal Coordinated Planning Amongst Self-Interested Agents with Private State
(AUAI Press, 2006)
Consider a multi-agent system in a dynamic and uncertain environment. Each agent’s local decision problem is modeled as a Markov decision process (MDP) and agents must coordinate on a joint action in each period, which ...
A Study of Nash Equilibrium in Contribution Games for Peer-to-Peer Networks
(Association for Computing Machinery, 2006)
We consider a stylized model of content contribution in a peer-to-peer network. The model is appealing because it allows for linear-quadratic payoff functions and for very general interaction patterns among agents. ...
Egg: An Extensible and Economics-Inspired Open Grid Computing Platform
(World Scientific Publishing, 2006)
The Egg project provides a vision and implementation of how heterogeneous computational requirements will be supported within a single grid and a compelling reason to explain why computational grids will thrive. Environment ...
The Sequential Auction Problem on eBay: An Empirical Analysis and a Solution
(Association for Computing Machinery, 2006)
Bidders on eBay have no dominant bidding strategy when faced with multiple auctions each offering an item of interest. As seen through an analysis of 1,956 auctions on eBay for a Dell E193FP LCD monitor, some bidders win ...
Passive Verification of the Strategyproofness of Mechanisms in Open Environments
(Association for Computing Machinery, 2006)
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyproofness is a central property in the design ...
Instantiating the Contingent Bids Model of Truthful Interdependent Value Auctions
(Association for Computing Machinery, 2006)
We consider the problem of auction design with agents that have interdependent values, i.e. values that depend on each others' private signals. We adopt the contingent bids model of Dasgupta and Maskin [3], and allow agents ...
Iterative Combinatorial Auctions
(MIT Press, 2006)
Practical secrecy-preserving, verifiably correct and trustworthy auctions.
(Association for Computing Machinery, 2006)
We present a practical system for conducting sealed-bid auctions that preserves the secrecy of the bids while providing for verifiable correctness and trustworthiness of the auction. The auctioneer must accept all bids ...