Sciweavers

199 search results - page 38 / 40
» Auctions with Untrustworthy Bidders
Sort
View
ATAL
2009
Springer
15 years 4 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...
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 4 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
92
Voted
FC
2004
Springer
120views Cryptology» more  FC 2004»
15 years 2 months ago
Identity-Based Chameleon Hash and Applications
Chameleon signatures are non-interactive signatures based on a hash-and-sign paradigm, and similar in efficiency to regular signatures. The distinguishing characteristic of chamel...
Giuseppe Ateniese, Breno de Medeiros
92
Voted
COLT
2003
Springer
15 years 2 months ago
Preference Elicitation and Query Learning
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
Avrim Blum, Jeffrey C. Jackson, Tuomas Sandholm, M...
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum