Seller-Focused Algorithms for Online Auctioning
Authors:
- 2 August 2001
- book chapter
- Published by Springer Nature
- p. 135-147
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Throughput-competitive on-line routing2002
- A Parametrization of the Auction Design SpaceGames and Economic Behavior, 2001
- Average-Case Analysis of Off-Line and On-Line Knapsack ProblemsJournal of Algorithms, 1998
- Computationally Manageable Combinational AuctionsManagement Science, 1998
- Randomized Algorithms1995
- On-line resource management with applications to routing and schedulingLecture Notes in Computer Science, 1995
- A new measure for the study of on-line algorithmsAlgorithmica, 1994
- Fast approximation algorithms for knapsack problems1977
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975