Sciweavers

36 search results - page 6 / 8
» An Approximate Model for Bidders in Sequential Automated Auc...
Sort
View
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
14 years 26 days 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
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
13 years 11 months ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
ATAL
2003
Springer
13 years 11 months ago
Generalizing preference elicitation in combinatorial auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 6 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
ECAI
2010
Springer
13 years 7 months ago
Addressing the Exposure Problem of Bidding Agents Using Flexibly Priced Options
Abstract. In this paper we introduce a new option pricing mechanism for reducing the exposure problem encountered by bidding agents with complementary valuations when participating...
Valentin Robu, Ioannis A. Vetsikas, Enrico H. Gerd...