Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Svetlana Olonetsky
@article{DBLP:journals/geb/FiatKLMO19,
author = {Amos Fiat and
Elias Koutsoupias and
Katrina Ligett and
Yishay Mansour and
Svetlana Olonetsky},
title = {Beyond myopic best response (in Cournot competition)},
journal = {Games Econ. Behav.},
volume = {113},
pages = {38--57},
year = {2019},
url = {https://doi.org/10.1016/j.geb.2013.12.006},
doi = {10.1016/J.GEB.2013.12.006},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/FiatKLMO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Olononetsky13,
author = {Svetlana Kurtsman},
title = {Variants and extentions to Nash equilibria: coalitions, envy, and
non-myopic agents},
school = {Tel Aviv University, Israel},
year = {2013},
url = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990025308280204146},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Olononetsky13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenFFKO12,
author = {Edith Cohen and
Michal Feldman and
Amos Fiat and
Haim Kaplan and
Svetlana Olonetsky},
title = {Envy-Free Makespan Approximation},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {1},
pages = {12--25},
year = {2012},
url = {https://doi.org/10.1137/100801597},
doi = {10.1137/100801597},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CohenFFKO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FiatKLMO12,
author = {Amos Fiat and
Elias Koutsoupias and
Katrina Ligett and
Yishay Mansour and
Svetlana Olonetsky},
editor = {Yuval Rabani},
title = {Beyond myopic best response (in Cournot competition)},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {993--1005},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.79},
doi = {10.1137/1.9781611973099.79},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/FiatKLMO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/CohenFFKO11,
author = {Edith Cohen and
Michal Feldman and
Amos Fiat and
Haim Kaplan and
Svetlana Olonetsky},
editor = {Ning Chen and
Edith Elkind and
Elias Koutsoupias},
title = {Truth, Envy, and Truthful Market Clearing Bundle Pricing},
booktitle = {Internet and Network Economics - 7th International Workshop, {WINE}
2011, Singapore, December 11-14, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7090},
pages = {97--108},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25510-6\_9},
doi = {10.1007/978-3-642-25510-6\_9},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/CohenFFKO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bar-NoyCOS10,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Svetlana Olonetsky and
Shakhar Smorodinsky},
title = {Online Conflict-Free Colouring for Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {4},
pages = {493--516},
year = {2010},
url = {https://doi.org/10.1017/S0963548309990587},
doi = {10.1017/S0963548309990587},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Bar-NoyCOS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/CohenFFKO10,
author = {Edith Cohen and
Michal Feldman and
Amos Fiat and
Haim Kaplan and
Svetlana Olonetsky},
editor = {David C. Parkes and
Chrysanthos Dellarocas and
Moshe Tennenholtz},
title = {Envy-free makespan approximation: extended abstract},
booktitle = {Proceedings 11th {ACM} Conference on Electronic Commerce (EC-2010),
Cambridge, Massachusetts, USA, June 7-11, 2010},
pages = {159--166},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1807342.1807368},
doi = {10.1145/1807342.1807368},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/CohenFFKO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-5326,
author = {Edith Cohen and
Michal Feldman and
Amos Fiat and
Haim Kaplan and
Svetlana Olonetsky},
title = {Truth and Envy in Capacitated Allocation Games},
journal = {CoRR},
volume = {abs/1003.5326},
year = {2010},
url = {http://arxiv.org/abs/1003.5326},
eprinttype = {arXiv},
eprint = {1003.5326},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-5326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-5328,
author = {Edith Cohen and
Michal Feldman and
Amos Fiat and
Haim Kaplan and
Svetlana Olonetsky},
title = {On the Interplay between Incentive Compatibility and Envy Freeness},
journal = {CoRR},
volume = {abs/1003.5328},
year = {2010},
url = {http://arxiv.org/abs/1003.5328},
eprinttype = {arXiv},
eprint = {1003.5328},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-5328.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-1072,
author = {Edith Cohen and
Michal Feldman and
Amos Fiat and
Haim Kaplan and
Svetlana Olonetsky},
title = {Envy-Free Makespan Approximation},
journal = {CoRR},
volume = {abs/0909.1072},
year = {2009},
url = {http://arxiv.org/abs/0909.1072},
eprinttype = {arXiv},
eprint = {0909.1072},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-1072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bar-NoyCOS07,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Svetlana Olonetsky and
Shakhar Smorodinsky},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Online Conflict-Free Colorings for Hypergraphs},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {219--230},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_21},
doi = {10.1007/978-3-540-73420-8\_21},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Bar-NoyCOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FiatKLO07,
author = {Amos Fiat and
Haim Kaplan and
Meital Levy and
Svetlana Olonetsky},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Strong Price of Anarchy for Machine Load Balancing},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {583--594},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_51},
doi = {10.1007/978-3-540-73420-8\_51},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FiatKLO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Bar-NoyCOS07,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Svetlana Olonetsky and
Shakhar Smorodinsky},
editor = {Phillip B. Gibbons and
Christian Scheideler},
title = {Weakening the online adversary just enough to get optimal conflict-free
colorings for intervals},
booktitle = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Diego, California, USA, June
9-11, 2007},
pages = {194--195},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1248377.1248409},
doi = {10.1145/1248377.1248409},
timestamp = {Wed, 21 Nov 2018 11:13:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Bar-NoyCOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/FiatLKO07,
author = {Amos Fiat and
Meital Levy and
Haim Kaplan and
Svetlana Olonetsky},
editor = {Steven J. Brams and
Kirk Pruhs and
Gerhard J. Woeginger},
title = {Strong Price of Anarchy for Machine Load Balancing},
booktitle = {Fair Division, 24.06. - 29.06.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07261},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1225},
timestamp = {Thu, 10 Jun 2021 13:02:10 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/FiatLKO07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FiatKLOS06,
author = {Amos Fiat and
Haim Kaplan and
Meital Levy and
Svetlana Olonetsky and
Ronen Shabo},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {On the Price of Stability for Designing Undirected Networks with Fair
Cost Allocations},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {608--618},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_53},
doi = {10.1007/11786986\_53},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FiatKLOS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-11-04 22:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
