Pages that link to "Item:Q2822037"
From MaRDI portal
The following pages link to Efficient constrained combinatorial auctions (Q2822037):
Displaying 18 items.
- An efficient multi-item dynamic auction with budget constrained bidders (Q495767) (← links)
- Iterative Dutch combinatorial auctions (Q812381) (← links)
- Hierarchical package bidding: a paper \& pencil combinatorial auction (Q993791) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Efficient combinatorial allocations: individual rationality versus stability (Q2098976) (← links)
- Mechanisms for combinatorial auctions with budget constraints (Q2318114) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Characterizing the incentive compatible and Pareto optimal efficiency space for two players, \(k\) items, public budget and quasilinear utilities (Q2346934) (← links)
- A formulation of combinatorial auction via reverse convex programming (Q2498233) (← links)
- Automated design of revenue-maximizing combinatorial auctions (Q2795862) (← links)
- Dictatorial mechanisms in constrained combinatorial auctions (Q2867515) (← links)
- Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding (Q3177806) (← links)
- Approximation algorithms for combinatorial auctions with complement-free bidders (Q3581408) (← links)
- On the Economic Efficiency of the Combinatorial Clock Auction (Q4575680) (← links)
- An Efficient Winner Approximation for a Series of Combinatorial Auctions (Q4932630) (← links)
- Auction/Belief Propagation Algorithms for Constrained Assignment Problem (Q5174969) (← links)
- Computing and Combinatorics (Q5716982) (← links)
