Sciweavers

361 search results - page 64 / 73
» Risk-averse auction agents
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
AAAI
2007
15 years 8 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
16 years 16 days ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
WEBI
2004
Springer
15 years 11 months ago
Incentive-Compatible Social Choice
Many situations present a social choice problem where different self-interested agents have to agree on joint, coordinated decisions. For example, power companies have to agree o...
Boi Faltings