Sciweavers

131 search results - page 21 / 27
» Designing Auctions for Deliberative Agents
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Characterizing false-name-proof allocation rules in combinatorial auctions
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
Selling Privacy at Auction
We initiate the study of markets for private data, through the lens of differential privacy. Although the purchase and sale of private data has already begun on a large scale, a t...
Arpita Ghosh, Aaron Roth
ICMAS
2000
13 years 8 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
ATAL
2010
Springer
13 years 8 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
AOIS
2003
13 years 9 months ago
Market-Based Recommendations: Design, Simulation and Evaluation
This paper reports on the design, implementation, and evaluation of a market-based recommender system that suggests relevant documents to users. The key feature of the system is t...
Yan Zheng Wei, Luc Moreau, Nicholas R. Jennings