Search
Now showing items 1-10 of 11
Pricing WiFi at Starbucks: Issues in Online Mechanism Design
(Association for Computing Machinery, 2003)
We consider the problem of designing mechanisms for online problems in which agents arrive over time and truthfully announce their arrival. These problems are becoming extremely common in a wide variety of problems involving ...
Strategyproof Mechanisms for Ad Hoc Network Formation
(2003)
Agents in a peer-to-peer system typically have incentives to influence its network structure, either to reduce their costs or to increase their ability to capture value. The problem is compounded when agents can join and ...
Rationality and Self-Interest in Peer to Peer Networks
(Springer Berlin, 2003)
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the userr's ability to modify the behavior of an algorithm for self-interested ...
Using Redundancy to Improve Robustness of Distributed Mechanism Implementations
(Association for Computing Machinery, 2003)
This paper introduces computation compatibility and communication compatibility as requirements for a distributed mechanism implementation. Just as payments are used to create incentive compatible mechanisms, some technique ...
Virtual Worlds: Fast and Strategyproof Auctions for Dynamic Resource Allocation
(Association for Computing Machinery, 2003)
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of auctions, with dynamically arriving requests ...
Computational-Mechanism Design: A Call to Arms
(Institute of Electrical and Electronics Engineers Computer Society, 2003)
Game theory has developed several powerful tools for analyzing decision making in systems composed of multiple autonomous actors. Given this fact, AI practitioners would like to exploit these tools when building software ...
Five AI Challenges in Strategyproof Computing
(2003)
Computational systems are now distributed by default, and designed, owned and used by multiple self-interested parties. In the face of this growing system complexity, we need a unifying design paradigm, that supports ...
Strategyproof Computing: Systems Infrastructures for Self-Interested Parties
(2003)
The widespread deployment of high-speed internet access is ushering in
a new era of distributed computing, in which parties both contribute to a global pool of shared resources and access the pooled resources to support ...
Preference Elicitation in Proxied Multiattribute Auctions
(Association for Computing Machinery, 2003)
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as quality, time-of-delivery, and processor speed. ...
Overcoming Rational Manipulation in Distributed Mechanism Implementations
(2003)
Distributed systems are increasingly made up of nodes governed by disparate self-interested parties. These parties can be modeled as rational (in a game theoretic sense) utility-maximizing players that participate in a ...