Hochschulschrift
ALPS - design and analysis of a robust iterative combinatorial auction format
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
München, Techn. Univ., Diss., 2009
- Creator
- URN
-
urn:nbn:de:bvb:91-diss-20090710-963459-1-7
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
Other Objects (12)
Pricing and bidding strategies in iterative combinatorial auctions
Min-max-min robust combinatorial optimization
Optimization Heuristics for the Combinatorial Auction Problem
Strategic complexities in the combinatorial clock auction
Characterizing the vickrey combinatorial auction by induction
Strategic complexities in the combinatorial clock auction
On the clock of the combinatorial clock auction
On the clock of the combinatorial clock auction
Complexity of bulk-robust combinatorial optimization problems
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions
An externality-robust auction: Theory and experimental evidence
Pricing and bidding strategies in iterative combinatorial auctions
Min-max-min robust combinatorial optimization
Optimization Heuristics for the Combinatorial Auction Problem
Strategic complexities in the combinatorial clock auction
Characterizing the vickrey combinatorial auction by induction
Strategic complexities in the combinatorial clock auction
On the clock of the combinatorial clock auction
On the clock of the combinatorial clock auction
Complexity of bulk-robust combinatorial optimization problems
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions
An externality-robust auction: Theory and experimental evidence
Pricing and bidding strategies in iterative combinatorial auctions
Min-max-min robust combinatorial optimization
Optimization Heuristics for the Combinatorial Auction Problem
Strategic complexities in the combinatorial clock auction
Characterizing the vickrey combinatorial auction by induction
Strategic complexities in the combinatorial clock auction
On the clock of the combinatorial clock auction
On the clock of the combinatorial clock auction
Complexity of bulk-robust combinatorial optimization problems
Solution Methods for Multi-Objective Robust Combinatorial Optimization
Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions