Sciweavers

85 search results - page 11 / 17
» Optimal allocation of electronic content
Sort
View
PPOPP
1997
ACM
13 years 11 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
IJNSEC
2007
111views more  IJNSEC 2007»
13 years 7 months ago
A Novel Peer-to-peer Payment Protocol
In this paper a novel electronic payment protocol suitable for “peer-to-peer” (P2P) networks is presented. It implements electronic cash-based transactions, between buyers and...
Despoina Palaka, Petros Daras, Kosmas Petridis, Mi...
FOCS
2006
IEEE
14 years 1 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
AAAI
2012
11 years 10 months ago
Optimal Auctions for Spiteful Bidders
Designing revenue-optimal auctions for various settings is perhaps the most important, yet sometimes most elusive, problem in mechanism design. Spiteful bidders have been intensel...
Pingzhong Tang, Tuomas Sandholm
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 26 days 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