Gagan Goel
ACM-SIAM Symposium on Discrete Algorithms · 2008
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Gagan Goel trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Gagan Goel overall
Papers from Gagan Goel's perspective
Ordered by how strongly the researchers Gagan Goel trusts endorse each paper. Same corpus, a different order for every researcher.
- Combinatorial auctions with decreasing marginal utilities
- Tight approximation algorithms for maximum general assignment problems (ACM-SIAM Symposium on Discrete Algorithms)
- The English Auction with Differentiated Commodities (Journal of Economics Theory)
- Bidding and allocation in combinatorial auctions (ACM Conference on Economics and Computation)
- Optimal Auction Design
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) (Conference on Integer Programming and Combinatorial Optimization)
- Truth revelation in approximately efficient combinatorial auctions (JACM)
- Computationally feasible VCG mechanisms (ACM Conference on Economics and Computation)
- Integer programming for combinatorial auction winner determination (Proceedings Fourth International Conference on MultiAgent Systems)
- Reducibility Among Combinatorial Problems
Their papers
- Online budgeted matching in random input models with applications to Adwords (2008) — 357 citations