Fair payments for efficient allocations in public sector combinatorial auctions
Year of publication: |
2007
|
---|---|
Authors: | Day, Robert W. ; Raghavan, S. |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 53.2007, 9, p. 1389-1406
|
Subject: | Auktionstheorie | Auction theory | Pareto-Optimum | Pareto efficiency | Operations Research | Operations research |
-
Ghosh, Debdas, (2015)
-
Proper balance between search towards and along Pareto front : biobjective TSP case study
Jaszkiewicz, Andrzej, (2017)
-
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
Parragh, Sophie N., (2022)
- More ...
-
A combinatorial procurement auction featuring bundle price revelation without free-riding
Day, Robert W., (2008)
-
The Landscape of Electronic Market Design
Anandalingam, G., (2005)
-
Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions
Day, Robert W., (2007)
- More ...