|
Google Research
Other Google Resources
|
A Truthful Mechanism for Offline Ad Slot Scheduling, Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal, Symposium on Algorithmic Game Theory, 2008.
Improved Algorithms for Orienteering and Related Problems, Chandra Chekuri, Nitish Korula, Martin Pál, Proc. 19th Annual Symposium on Discrete Algorithms (SODA), 2008.
Online Ad Slotting with Cancellations, Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal, Fourth Workshop on Ad Auctions, 2008 (to appear).
Sponsored Search Auctions for Markovian Users, Gagan Aggarwal, Jon Feldman, Martin Pal, S. Muthukrishnan, Fourth Workshop on Ad Auctions, 2008 (to appear).
Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network Design, Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden, Journal of the ACM, vol. 54, no 3 (2007), pp. 11.
Budget Optimization in Search-Based Advertising Auctions, Jon Feldman, S. Muthukrishnan, Martin Pál, Cliff Stein, Proc. ACM Conference on Electronic Commerce, 2007.
Maximizing a Submodular Set Function subject to a Matroid Constraint, Chandra Chekuri, Gruia Calinescu, Martin Pál, Jan Vondrák, Proceedings of the Twelfth Conference on Integer Programming and Combinatorial Optimization (IPCO) 2007.
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy, L. Becchetti, J. Könemann, S. Leonardi, Martin Pál, ACM Transactions on Algorithms, vol. 3, no 2 (2007), pp. 23.
Stochastic Models for Budget Optimization in Search-Based Advertising, S. Muthukrishnan, Martin Pál, Zoya Svitkina, Internet and Network Economics (WINE), 2007, pp. 131-142.
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem, Chandra Chekuri, Martin Pál, Proceedings of APPROX 2006.
|
|
