SIGECOM 2005 - PDF Preprint Papers

SIGECOM 2005 Electronic Commerce

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIGECOM-2005 Paper

click to vote

SIGECOM
2005
ACM

169views ECommerce» more SIGECOM 2005»

Online auctions with re-usable goods

13 years 10 months ago

Download www.mit.edu

This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...

Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	169	Online auctions with re-usable goods	claim
2	166	A price-anticipating resource allocation mechanism for distributed shared clusters	claim
3	153	Marginal contribution nets: a compact representation scheme for coalitional games	claim
4	134	Congestion games with failures	claim
5	132	Integrating tradeoff support in product search tools for e-commerce sites	claim
6	130	Graceful service degradation (or, how to know your payment is late)	claim
7	122	Multi-unit auctions with budget-constrained bidders	claim
8	122	Robust solutions for combinatorial auctions	claim
9	120	Optimal design of English auctions with discrete bid levels	claim
10	118	Content availability, pollution and poisoning in file sharing peer-to-peer networks	claim
11	117	First-price path auctions	claim
12	113	Dynamic and secure B2B e-contract update management	claim
13	109	From optimal limited to unlimited supply auctions	claim
14	109	Cost sharing in a job scheduling problem using the Shapley value	claim
15	108	On the computational power of iterative auctions	claim
16	106	On decentralized incentive compatible mechanisms	claim
17	105	Communication complexity of common voting rules	claim
18	105	Towards truthful mechanisms for binary demand games: a general framework	claim
19	101	Fairness and optimality in congestion games	claim
20	100	Information markets vs. opinion pools: an empirical comparison	claim
21	98	Hidden-action in multi-hop routing	claim
22	97	Complexity of (iterated) dominance	claim
23	93	Ranking systems: the PageRank axioms	claim
24	92	True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs	claim
25	90	ICE: an iterative combinatorial exchange	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers