Opportunity cost algorithms for combinatorial auctions
| Year of publication: |
2010
|
|---|---|
| Authors: | Akcoglu, Karhan ; Aspnes, James ; DasGupta, Bhaskar ; Kao, Ming-Yang |
| Published in: |
Computational methods in decision-making, economics and finance. - Drodrecht [u.a.] : Kluwer Academic Pub, ISBN 978-1-4419-5230-1. - 2010, p. 455-479
|
| Subject: | Auktionstheorie | Auction theory | Opportunitätskosten | Opportunity cost | Budgetrestriktion | Budget constraint | Algorithmus | Algorithm | Iteratives Verfahren | Approximation method |
-
Handbook of research on soft computing and nature-inspired algorithms
Shandilya, Shishir K., (2017)
-
Fast approximation methods for online scheduling of outpatient procedure centers
Berg, Bjorn P., (2017)
-
A sample average approximation method for disassemblx line balancing problem under uncertainty
Bentaha, Mohand Lounes, (2014)
- More ...
-
Towards a comprehensive index of labour law reform and ranking of states
Dasgupta, Bhaskar, (2023)
-
Optimal search for parameters in Monte Carlo simulation for derivative pricing
Wang, Chuan-Ju, (2016)
-
Linear-Time Accurate Lattice Algorithms for Tail Conditional Expectation
Chen, Bryant, (2014)
- More ...