default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOren Ben-Zwi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Oren Ben-Zwi, Ilan Newman:
No Ascending Auction can find Equilibrium for SubModular valuations. CoRR abs/2312.00522 (2023)
2010 – 2019
- 2017
- [j8]Oren Ben-Zwi:
Walrasian's characterization and a universal ascending auction. Games Econ. Behav. 104: 456-467 (2017) - 2016
- [i4]Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer:
Ad Exchange: Envy-Free Auctions with Mediators. CoRR abs/1604.05562 (2016) - [i3]Oren Ben-Zwi:
Walrasian's Characterization and a Universal Ascending Auction. CoRR abs/1605.03826 (2016) - 2015
- [j7]Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz:
Hats, auctions and derandomization. Random Struct. Algorithms 46(3): 478-493 (2015) - [c6]Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer:
Ad Exchange: Envy-Free Auctions with Mediators. WINE 2015: 104-117 - 2013
- [i2]Oren Ben-Zwi, Ron Lavi, Ilan Newman:
Ascending auctions and Walrasian equilibrium. CoRR abs/1301.1153 (2013) - 2011
- [b1]Oren Ben-Zwi:
Algorithmic Game Theory and Graphs. University of Haifa, Israel, 2011 - [j6]Oren Ben-Zwi, Danny Hermelin
, Daniel Lokshtanov, Ilan Newman:
Treewidth governs the complexity of target set selection. Discret. Optim. 8(1): 87-96 (2011) - [j5]Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-Zwi:
Applying Property Testing to an Image Partitioning Problem. IEEE Trans. Pattern Anal. Mach. Intell. 33(2): 256-265 (2011) - [j4]Oren Ben-Zwi, Amir Ronen:
Local and global price of anarchy of graphical games. Theor. Comput. Sci. 412(12-14): 1196-1207 (2011) - [i1]Oren Ben-Zwi, Ilan Newman:
Optimal Bi-Valued Auctions. CoRR abs/1106.4677 (2011) - 2010
- [j3]Eyal Ackerman, Oren Ben-Zwi, Guy Wolfovitz:
Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411(44-46): 4017-4022 (2010) - [c5]Oren Ben-Zwi, Guy Wolfovitz:
A Hat Trick. FUN 2010: 37-40
2000 – 2009
- 2009
- [j2]Eyal Ackerman, Oren Ben-Zwi:
On sets of points that determine only acute angles. Eur. J. Comb. 30(4): 908-910 (2009) - [c4]Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz:
A New Derandomization of Auctions. SAGT 2009: 233-237 - [c3]Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman:
An exact almost optimal algorithm for target set selection in social networks. EC 2009: 355-362 - 2008
- [c2]Oren Ben-Zwi, Amir Ronen:
The Local and Global Price of Anarchy of Graphical Games. SAGT 2008: 255-266 - 2007
- [j1]Oren Ben-Zwi, Oded Lachish, Ilan Newman:
Lower bounds for testing Euclidean Minimum Spanning Trees. Inf. Process. Lett. 102(6): 219-225 (2007) - 2005
- [c1]Oren Ben-Zwi, Shlomit S. Pinter:
Handling Sensed Data in Hostile Environments. MSN 2005: 433-442
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-08-05 21:11 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:
