Sciweavers

26 search results - page 2 / 6
» sigecom 2005
Sort
View
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
13 years 10 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
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
SIGECOM
2005
ACM
130views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Graceful service degradation (or, how to know your payment is late)
When distributing digital content over a broadcast channel it’s often necessary to revoke users whose access privileges have expired, thus preventing them from recovering the co...
Alexandr Andoni, Jessica Staddon