Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
207 | Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, Jennifer Wortman |
Regret to the best vs. regret to the average. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 72(1-2), pp. 21-37, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Prediction with expert advice, Lower bounds, Online learning, Regret minimization |
187 | Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, Jennifer Wortman |
Regret to the Best vs. Regret to the Average. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 233-247, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
150 | Amy Greenwald, Amir Jafari |
A General Class of No-Regret Learning Algorithms and Game-Theoretic Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings, pp. 2-12, 2003, Springer, 3-540-40720-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
133 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Complexity of the Min-Max (Regret) Versions of Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 789-798, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, s–t min cut, complexity, min cut, min-max |
120 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 862-873, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
113 | John Langford 0001, Alina Beygelzimer |
Sensitive Error Correcting Output Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings, pp. 158-172, 2005, Springer, 3-540-26556-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
112 | Jason R. Marden, Gürdal Arslan, Jeff S. Shamma |
Regret based dynamics: convergence in weakly acyclic games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), Honolulu, Hawaii, USA, May 14-18, 2007, pp. 42, 2007, IFAAMAS, 978-81-904262-7-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
game theory, learning algorithms, emergent behavior, multiagent learning, cooperative distributed problem solving |
108 | Baruch Awerbuch, Thomas P. Hayes |
Online collaborative filtering with nearly optimal dynamic regret. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 315-319, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
online decision making, regret, learning, collaborative filtering, multiagent systems |
100 | Darius Braziunas, Craig Boutilier |
Assessing regret-based preference elicitation with the UTPREF recommendation system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 219-228, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
utility elicitation, recommender systems, user studies |
87 | Geoffrey J. Gordon, Amy Greenwald, Casey Marks |
No-regret learning in convex games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fifth International Conference (ICML 2008), Helsinki, Finland, June 5-9, 2008, pp. 360-367, 2008, ACM, 978-1-60558-205-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
87 | Avrim Blum, Yishay Mansour |
From External to Internal Regret. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings, pp. 621-636, 2005, Springer, 3-540-26556-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
84 | Nikhil R. Devanur, Sham M. Kakade |
The price of truthfulness for pay-per-click auctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 99-106, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
regret, auction, online, truthful, multi-armed bandit, pay-per-click |
83 | Gilles Stoltz, Gábor Lugosi |
Internal Regret in On-Line Portfolio Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 59(1-2), pp. 125-159, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
individual sequences, internal regret, on-line investment, universal Portfolio, EG strategy |
76 | Sébastien Bubeck, Rémi Munos, Gilles Stoltz |
Pure Exploration in Multi-armed Bandits Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009. Proceedings, pp. 23-37, 2009, Springer, 978-3-642-04413-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
76 | Elad Hazan, C. Seshadhri 0001 |
Efficient learning algorithms for changing environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 393-400, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
76 | Jean-Yves Audibert, Rémi Munos, Csaba Szepesvári |
Tuning Bandit Algorithms in Stochastic Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 150-165, 2007, Springer, 978-3-540-75224-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
76 | Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden |
How to Better Use Expert Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 55(3), pp. 271-309, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
online prediction, learning from expert advice, online learning |
75 | Jan-P. Calliess |
On Fixed Convex Combinations of No-Regret Learners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 6th International Conference, MLDM 2009, Leipzig, Germany, July 23-25, 2009. Proceedings, pp. 494-504, 2009, Springer, 978-3-642-03069-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
75 | M. P. Mulaudzi, Mark Adam Petersen, I. M. Schoeman |
Optimal allocation between bank loans and treasuries with regret. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 2(4), pp. 555-566, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Optimization theory, Financial economics, Credit crunch, Banks |
75 | Varsha Dani, Thomas P. Hayes |
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 937-943, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
70 | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang |
Improved algorithms for the minmax-regret 1-center and 1-median problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 36:1-36:27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minmax-regret optimization, trees, medians, Location theory, centers, general graphs |
70 | Elad Hazan, Amit Agarwal 0008, Satyen Kale |
Logarithmic regret algorithms for online convex optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 169-192, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Online learning, Portfolio management, Online optimization, Regret minimization |
70 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 428-438, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas |
63 | Elad Hazan, Satyen Kale |
Better algorithms for benign bandits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 38-47, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
63 | Bikramjit Banerjee, Jing Peng |
Generalized multiagent learning with performance bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Auton. Agents Multi Agent Syst. ![In: Auton. Agents Multi Agent Syst. 15(3), pp. 281-312, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Multiagent reinforcement learning, Game theory |
63 | Yonina C. Eldar, Neri Merhav |
Minimax MSE-ratio estimation with signal covariance uncertainties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 53(4), pp. 1335-1347, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
62 | Gilles Stoltz, Gábor Lugosi |
Internal Regret in On-Line Portfolio Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings, pp. 403-417, 2003, Springer, 3-540-40720-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
61 | Avrim Blum, Eyal Even-Dar, Katrina Ligett |
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 45-52, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
game theory, network games |
57 | Eyal Even-Dar, Yishay Mansour, Uri Nadav |
On the convergence of regret minimization dynamics in concave games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 523-532, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
learning equilibrium, algorithmic game theory, regret minimization |
57 | Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth 0001 |
Regret minimization and the price of total anarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 373-382, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
nash equilibria, algorithmic game theory, regret minimization |
57 | Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang |
Improved Algorithms for the Minmax-Regret 1-Center Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 537-546, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minmax-regret optimization, location theory, centers |
57 | Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang |
Improved Algorithms for the Minmax Regret 1-Median Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 52-62, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
minmax regret optimization, medians, Location theory |
49 | Vianney Perchet |
Calibration and Internal No-Regret with Random Signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009. Proceedings, pp. 68-82, 2009, Springer, 978-3-642-04413-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal 0008 |
Logarithmic Regret Algorithms for Online Convex Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 499-513, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
49 | Bikramjit Banerjee, Jing Peng |
Unifying Convergence and No-Regret in Multiagent Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAMAS ![In: Learning and Adaption in Multi-Agent Systems, First International Workshop, LAMAS 2005, Utrecht, The Netherlands, July 25, 2005, Revised Selected Papers, pp. 100-114, 2005, Springer, 3-540-33053-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Tim Roughgarden |
Intrinsic robustness of the price of anarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 513-522, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
regret-minimizat, price of anarchy, nash equilibria, congestion games |
46 | Nie Nie, Cristina Comaniciu |
Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 11(6), pp. 779-797, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
potential game, no-regret learning, cognitive radio, channel allocation |
46 | Nicolò Cesa-Bianchi, Gábor Lugosi |
Potential-Based Algorithms in Online Prediction and Game Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT/EuroCOLT ![In: Computational Learning Theory, 14th Annual Conference on Computational Learning Theory, COLT 2001 and 5th European Conference on Computational Learning Theory, EuroCOLT 2001, Amsterdam, The Netherlands, July 16-19, 2001, Proceedings, pp. 48-64, 2001, Springer, 3-540-42343-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
universal prediction, Blackwell's strategy, weighted average predictors, internal regret, boosting, on-line learning, Perceptron algorithm |
45 | Paolo Viappiani, Craig Boutilier |
Regret-based optimal recommendation sets in conversational recommender systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RecSys ![In: Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, October 23-25, 2009, pp. 101-108, 2009, ACM, 978-1-60558-435-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimax regret, recommender systems, preference elicitation, critiquing |
45 | Alfredo Candia-Véjar, Eduardo Álvarez-Miranda |
On a Class of Interval Data Minmax Regret CO Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007, pp. 123-128, 2007, Springer, 978-3-540-77902-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minmax regret, Approximation algorithm, interval data |
38 | Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins |
Characterizing truthful multi-armed bandit mechanisms: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 79-88, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
single-parameter auctions, mechanism design, online learning, multi-armed bandits, truthful mechanisms |
38 | Maria-Florina Balcan, Nikhil Bansal 0001, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin |
Robust reductions from ranking to classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 72(1-2), pp. 139-153, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Classification, Ranking, Reductions |
38 | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz |
Improved second-order bounds for prediction with expert advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 66(2-3), pp. 321-352, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Individual sequences, Prediction with expert advice, Exponentially weighted averages |
38 | Jussi Kujala, Tapio Elomaa |
Following the Perturbed Leader to Gamble at Multi-armed Bandits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings, pp. 166-180, 2007, Springer, 978-3-540-75224-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Peter Auer, Ronald Ortner, Csaba Szepesvári |
Improved Rates for the Stochastic Continuum-Armed Bandit Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 454-468, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Maria-Florina Balcan, Nikhil Bansal 0001, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin |
Robust Reductions from Ranking to Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 604-619, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
38 | Pascal Van Hentenryck, Russell Bent, Yannis Vergados |
Online Stochastic Reservation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings, pp. 212-227, 2006, Springer, 3-540-34306-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Panrasee Ritthipravat, Thavida Maneewarn, Jeremy L. Wyatt, Djitt Laowattana |
Fuzzy-Q Knowledge Sharing Techniques with Expertness Measures: Comparison and Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 544-554, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
38 | Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz |
Improved Second-Order Bounds for Prediction with Expert Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings, pp. 217-232, 2005, Springer, 3-540-26556-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Yiling Chen 0001, Jennifer Wortman Vaughan |
A new understanding of prediction markets via no-regret learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 189-198, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
follow the regularized leader, prediction with expert advice, online learning, prediction markets, market scoring rules |
37 | Mark D. Reid, Robert C. Williamson |
Surrogate regret bounds for proper losses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 897-904, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp. 280-291, 2008, Springer, 978-3-540-77565-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data |
37 | Anna Gambin, Ewa Szczurek |
No-Regret Boosting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANNGA (1) ![In: Adaptive and Natural Computing Algorithms, 8th International Conference, ICANNGA 2007, Warsaw, Poland, April 11-14, 2007, Proceedings, Part I, pp. 422-431, 2007, Springer, 978-3-540-71589-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Yu-Han Chang, Leslie Pack Kaelbling |
Hedged learning: regret-minimization with learning experts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Second International Conference (ICML 2005), Bonn, Germany, August 7-11, 2005, pp. 121-128, 2005, ACM, 1-59593-180-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter |
Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 159-164, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
33 | Craig Boutilier, Kevin Regan 0001, Paolo Viappiani |
Preference elicitation with subjective features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RecSys ![In: Proceedings of the 2009 ACM Conference on Recommender Systems, RecSys 2009, New York, NY, USA, October 23-25, 2009, pp. 341-344, 2009, ACM, 978-1-60558-435-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
minimax regret, recommender systems, concept learning, preference elicitation, version space |
33 | Michael Dinitz |
Brief announcement: distributed algorithms for approximating wireless network capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 328-329, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
no-regret, approximation algorithms, distributed algorithms, network capacity |
33 | Nicolò Cesa-Bianchi, Gábor Lugosi |
Potential-Based Algorithms in On-Line Prediction and Game Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 51(3), pp. 239-261, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
universal prediction, Blackwell's strategy, weighted average predictors, internal regret, boosting, on-line learning, perceptron algorithm |
32 | Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha |
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSF ![In: Proceedings of the 24th IEEE Computer Security Foundations Symposium, CSF 2011, Cernay-la-Ville, France, 27-29 June, 2011, pp. 312-327, 2011, IEEE Computer Society, 978-1-61284-644-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
Auditing Learning Game Model Regret Minimization Economics |
32 | Marcin Siepak, Jerzy Józefczyk |
Minmax Regret Algorithms for Uncertain PCmax Problem with Interval Processing Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSEng ![In: 21st International Conference on Systems Engineering (ICSEng 2011), Las Vegas, NV, USA, Aug. 16-18, 2011, pp. 115-119, 2011, IEEE, 978-1-4577-1078-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
minmax regret, resource allocation, uncertainty, task scheduling, Scatter Search |
32 | Erick Delage |
Regret-based online ranking for a growing digital library. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 229-238, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
exploration-exploitation, web search, learning to rank, click-through data, regret minimization |
32 | Hassene Aissi |
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 4(4), pp. 347-350, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Min-max regret, Complexity, Combinatorial optimization, Approximation, Data association, Robustness analysis, Min-max |
25 | Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat |
Coding on Countably Infinite Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(1), pp. 358-373, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Alina Beygelzimer, John Langford 0001 |
The offset tree for learning with partial labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 129-138, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
associative reinforcement learning, contextual bandits, interactive learning |
25 | Zhengya Sun, Tao Qin, Qing Tao, Jue Wang 0004 |
Robust sparse rank learning for non-smooth ranking measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGIR ![In: Proceedings of the 32nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2009, Boston, MA, USA, July 19-23, 2009, pp. 259-266, 2009, ACM, 978-1-60558-483-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
rsrank, truncated gradient, information retrieval, learn to rank |
25 | Jia Yuan Yu, Shie Mannor |
Piecewise-stationary bandit problems with side observations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 1177-1184, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Ilya Sutskever |
A simpler unified analysis of budget perceptrons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 985-992, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Aaron Roth 0001 |
The Price of Malice in Linear Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 118-125, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Jean-François Hren, Rémi Munos |
Optimistic Planning of Deterministic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWRL ![In: Recent Advances in Reinforcement Learning, 8th European Workshop, EWRL 2008, Villeneuve d'Ascq, France, June 30 - July 3, 2008, Revised and Selected Papers, pp. 151-164, 2008, Springer, 978-3-540-89721-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Jia Yuan Yu, Shie Mannor, Nahum Shimkin |
Markov Decision Processes with Arbitrary Reward Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EWRL ![In: Recent Advances in Reinforcement Learning, 8th European Workshop, EWRL 2008, Villeneuve d'Ascq, France, June 30 - July 3, 2008, Revised and Selected Papers, pp. 268-281, 2008, Springer, 978-3-540-89721-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Vladimir Vovk |
Competing with wild prediction rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 69(2-3), pp. 193-212, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Competitive on-line prediction, Square loss regression, Banach function space |
25 | Suleyman Serdar Kozat, Andrew C. Singer, Georg Zeitler |
Universal Piecewise Linear Prediction Via Context Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(7-2), pp. 3730-3745, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Nathaniel Good, Jens Grossklags, Deirdre K. Mulligan, Joseph A. Konstan |
Noticing notice: a large-scale experiment on the timing of software license agreements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 2007 Conference on Human Factors in Computing Systems, CHI 2007, San Jose, California, USA, April 28 - May 3, 2007, pp. 607-616, 2007, ACM, 978-1-59593-593-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
end user license agreement, notice, security, privacy, timing, spyware |
25 | Sandeep Pandey, Deepayan Chakrabarti, Deepak Agarwal |
Multi-armed bandit problems with dependent arms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Fourth International Conference (ICML 2007), Corvallis, Oregon, USA, June 20-24, 2007, pp. 721-728, 2007, ACM, 978-1-59593-793-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Nadia Zerida, Nadine Lucas, Bruno Crémilleux |
Exclusion-inclusion based text categorization of biomedical articles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Symposium on Document Engineering ![In: Proceedings of the 2007 ACM Symposium on Document Engineering, Winnipeg, Manitoba, Canada, August 28-31, 2007, pp. 202-204, 2007, ACM, 978-1-59593-776-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
text mining, categorization, characterisation |
25 | Yonina C. Eldar |
Robust Competitive Estimation With Signal and Noise Covariance Uncertainties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(10), pp. 4532-4547, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Yonina C. Eldar |
Minimax estimation of deterministic parameters in linear models with a random model matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 54(2), pp. 601-612, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Eyal Even-Dar, Michael J. Kearns, Jennifer Wortman |
Risk-Sensitive Online Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings, pp. 199-213, 2006, Springer, 3-540-46649-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Shie Mannor, Nahum Shimkin |
Online Learning with Variable Stage Duration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 408-422, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Vladimir Vovk |
Competing with Wild Prediction Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings, pp. 559-573, 2006, Springer, 3-540-35294-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Panrasee Ritthipravat, Thavida Maneewarn, Jeremy L. Wyatt, Djitt Laowattana |
Comparison and Analysis of Expertness Measure in Knowledge Sharing Among Robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Advances in Applied Artificial Intelligence, 19th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2006, Annecy, France, June 27-30, 2006, Proceedings, pp. 60-69, 2006, Springer, 3-540-35453-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Amit Agarwal 0008, Elad Hazan, Satyen Kale, Robert E. Schapire |
Algorithms for portfolio management based on the Newton method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006, pp. 9-16, 2006, ACM, 1-59593-383-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Yonina C. Eldar |
Robust deconvolution of deterministic and random signals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(8), pp. 2921-2929, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan |
Online convex optimization in the bandit setting: gradient descent without a gradient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 385-394, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
25 | Jussi Kujala, Tapio Elomaa |
On Following the Perturbed Leader in the Bandit Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings, pp. 371-385, 2005, Springer, 3-540-29242-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Jan Poland |
FPL Analysis for Adaptive Bandits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGA ![In: Stochastic Algorithms: Foundations and Applications, Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings, pp. 58-69, 2005, Springer, 3-540-29498-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Adam Kalai, Santosh S. Vempala |
Efficient Algorithms for Online Decision Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings, pp. 26-40, 2003, Springer, 3-540-40720-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Amy Greenwald, Jeffrey O. Kephart |
Probabilistic pricebots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Agents ![In: Proceedings of the Fifth International Conference on Autonomous Agents, AGENTS 2001, Montreal, Canada, May 28 - June 1, 2001, pp. 560-567, 2001, ACM, 1-58113-326-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
economic software agents, pricebots, shopbots |
25 | Ronen I. Brafman, Moshe Tennenholtz |
An axiomatic treatment of three qualitative decision criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(3), pp. 452-482, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
choice theory, foundations of online algorithms, qualitative decision theory, agent models |
25 | Eiji Takimoto, Manfred K. Warmuth |
The Last-Step Minimax Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11-13, 2000, Proceedings, pp. 279-290, 2000, Springer, 3-540-41237-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Robert D. Kleinberg, Georgios Piliouras, Éva Tardos |
Load balancing without regret in the bulletin board model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 56-62, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
game theory, price of anarchy, learning theory |
24 | Robert Kleinberg, Georgios Piliouras, Éva Tardos |
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 533-542, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
game theory, price of anarchy, learning theory |
24 | Gregory Z. Gutin, Boris Goldengorin, Jing Huang 0007 |
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(2), pp. 169-181, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Traveling salesman problem, Greedy heuristics, Multidimensional assignment problem, Domination analysis |
24 | Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir |
New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 230-240, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
networks, facility location, Analysis of algorithms |
24 | Yishay Mansour |
Learning, regret minimization and option pricing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), Brussels, Belgium, June 25-27, 2007, pp. 2-3, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Stefan König 0001, Sven Kaffille, Guido Wirtz |
Implementing ReGreT in a Decentralized Multi-agent Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MATES ![In: Multiagent System Technologies, 5th German Conference, MATES 2007, Leipzig, Germany, September 24-26, 2007, Proceedings, pp. 194-205, 2007, Springer, 978-3-540-74948-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Adina Magda Florea, Eugenia Kalisz |
Adaptive Negotiation Based on Rewards and Regret in a Multi-Agent Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: Proceedings of the Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2007, Timisoara, Romania, September 26-29, 2007, pp. 254-259, 2007, IEEE Computer Society, 978-0-7695-3078-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Yunzhou Wu, Prashant Doshi |
Regret-Based Decentralized Adaptation ofWeb Processes with Coordination Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE SCC ![In: 2007 IEEE International Conference on Services Computing (SCC 2007), 9-13 July 2007, Salt Lake City, Utah, USA, pp. 262-269, 2007, IEEE Computer Society, 0-7695-2925-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Gregory Z. Gutin, Boris Goldengorin, Jing Huang 0007 |
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 214-225, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Eduardo Conde |
An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 100(2), pp. 345-353, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
complexity, knapsack problem, robust optimization, polynomial algorithm |