Algorithmic mechanism design with investment
Year of publication: |
2023
|
---|---|
Authors: | Akbarpour, Mohammad ; Kominers, Scott Duke ; Li, Kevin Michael ; Li, Shengwu ; Milgrom, Paul |
Published in: |
Econometrica : journal of the Econometric Society, an international society for the advancement of economic theory in its relation to statistics and mathematics. - Chichester : Wiley-Blackwell, ISSN 1468-0262, ZDB-ID 1477253-X. - Vol. 91.2023, 6, p. 1969-2003
|
Subject: | algorithms | approximation | auctions | Combinatorial optimization | investment | Knapsack problem | Algorithmus | Algorithm | Auktionstheorie | Auction theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Mechanismus-Design-Theorie | Mechanism design | Investition | Investment | Scheduling-Verfahren | Scheduling problem |
-
Winner determination algorithms for combinatorial auctions with sub-cardinality constraints
Garcia, Christopher, (2016)
-
Auction-based algorithm for solving scheduling problem in cross-docking centres
Paul, Eldho, (2020)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
The parable of the auctioneer : complexity in Paul R. Milgrom's Discovering prices
Kominers, Scott Duke, (2020)
-
Bargaining costs, influence costs and the organization of economic activity
Milgrom, Paul, (2009)
-
Multitask principal-agent analyses : incentive contracts, asset ownership and job design
Holmström, Bengt, (2009)
- More ...