default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSvetlana Olonetsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j3]Amos Fiat, Elias Koutsoupias, Katrina Ligett
, Yishay Mansour, Svetlana Olonetsky:
Beyond myopic best response (in Cournot competition). Games Econ. Behav. 113: 38-57 (2019)- 2013
- [b1]Svetlana Kurtsman:
Variants and extentions to Nash equilibria: coalitions, envy, and non-myopic agents. Tel Aviv University, Israel, 2013 - 2012
- [j2]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-Free Makespan Approximation. SIAM J. Comput. 41(1): 12-25 (2012) - [c7]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky:
Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005 - 2011
- [c6]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Truth, Envy, and Truthful Market Clearing Bundle Pricing. WINE 2011: 97-108 - 2010
- [j1]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colouring for Hypergraphs. Comb. Probab. Comput. 19(4): 493-516 (2010) - [c5]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-free makespan approximation: extended abstract. EC 2010: 159-166 - [i4]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Truth and Envy in Capacitated Allocation Games. CoRR abs/1003.5326 (2010) - [i3]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
On the Interplay between Incentive Compatibility and Envy Freeness. CoRR abs/1003.5328 (2010)
2000 – 2009
- 2009
- [i2]Edith Cohen, Michal Feldman, Amos Fiat, Haim Kaplan, Svetlana Olonetsky:
Envy-Free Makespan Approximation. CoRR abs/0909.1072 (2009) - 2007
- [c4]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Online Conflict-Free Colorings for Hypergraphs. ICALP 2007: 219-230 - [c3]Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. ICALP 2007: 583-594 - [c2]Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky:
Weakening the online adversary just enough to get optimal conflict-free colorings for intervals. SPAA 2007: 194-195 - [i1]Amos Fiat, Meital Levy, Haim Kaplan, Svetlana Olonetsky:
Strong Price of Anarchy for Machine Load Balancing. Fair Division 2007 - 2006
- [c1]Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo:
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. ICALP (1) 2006: 608-618
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:02 CEST 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:
