Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "Approximate Strong Equilibrium in Job Scheduling Games"
@article{DBLP:journals/corr/FeldmanT14, author = {Michal Feldman and Tami Tamir}, title = {Approximate Strong Equilibrium in Job Scheduling Games}, journal = {CoRR}, volume = {abs/1401.3494}, year = {2014}, url = {http://arxiv.org/abs/1401.3494}, eprinttype = {arXiv}, eprint = {1401.3494}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/FeldmanT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/FeldmanT09, author = {Michal Feldman and Tami Tamir}, title = {Approximate Strong Equilibrium in Job Scheduling Games}, journal = {J. Artif. Intell. Res.}, volume = {36}, pages = {387--414}, year = {2009}, url = {https://doi.org/10.1613/jair.2892}, doi = {10.1613/JAIR.2892}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jair/FeldmanT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sagt/FeldmanT08, author = {Michal Feldman and Tami Tamir}, editor = {Burkhard Monien and Ulf{-}Peter Schroeder}, title = {Approximate Strong Equilibrium in Job Scheduling Games}, booktitle = {Algorithmic Game Theory, First International Symposium, {SAGT} 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4997}, pages = {58--69}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-79309-0\_7}, doi = {10.1007/978-3-540-79309-0\_7}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sagt/FeldmanT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.