default search action
Amir Ronen
Person information
- affiliation: IBM Research-Haifa, Israel
- award: Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [i3]Shahar Harel, Meir Maor, Amir Ronen:
Semantic Preserving Generative Adversarial Models. CoRR abs/1910.02804 (2019) - 2014
- [j6]Dorit Baras, Amir Ronen, Elad Yom-Tov
:
The effect of social affinity and predictive horizon on churn prediction using diffusion modeling. Soc. Netw. Anal. Min. 4(1): 232 (2014) - [c15]Shahar Dobzinski, Amir Ronen:
Shared Resource Management via Reward Schemes. SAGT 2014: 98-109 - 2013
- [i2]Ryan Porter, Amir Ronen, Yoav Shoham, Moshe Tennenholtz:
Mechanism Design with Execution Uncertainty. CoRR abs/1301.0595 (2013) - 2011
- [j5]Oren Ben-Zwi, Amir Ronen:
Local and global price of anarchy of graphical games. Theor. Comput. Sci. 412(12-14): 1196-1207 (2011) - [i1]Noam Nisan, Amir Ronen:
Computationally Feasible VCG Mechanisms. CoRR abs/1110.0025 (2011) - 2010
- [c14]Dan Pelleg, Eran Raichstein, Amir Ronen:
Using machine learning techniques to enhance the performance of an automatic backup and recovery system. SYSTOR 2010
2000 – 2009
- 2008
- [j4]Ryan Porter, Amir Ronen, Yoav Shoham, Moshe Tennenholtz:
Fault tolerant mechanism design. Artif. Intell. 172(15): 1783-1799 (2008) - [c13]Oren Ben-Zwi, Amir Ronen:
The Local and Global Price of Anarchy of Graphical Games. SAGT 2008: 255-266 - 2007
- [j3]Noam Nisan, Amir Ronen:
Computationally Feasible VCG Mechanisms. J. Artif. Intell. Res. 29: 19-47 (2007) - 2005
- [c12]Amir Ronen, Daniel Lehmann:
Nearly optimal multi attribute auctions. EC 2005: 279-285 - [c11]Amir Ronen, Rina Talisman:
Towards Generic Low Payment Mechanisms for Decentralized Task Allocation: A Learning Based Approach. CEC 2005: 126-133 - [c10]Amir Ronen, Lyron Wahrmann:
Prediction Games. WINE 2005: 129-140 - 2004
- [c9]Artur Czumaj, Amir Ronen:
On the expected payment of mechanisms for task allocation. PODC 2004: 98-106 - [c8]Artur Czumaj, Amir Ronen:
On the expected payment of mechanisms for task allocation: [extended abstract]. EC 2004: 252-253 - 2002
- [c7]Amir Ronen, Amin Saberi:
On the Hardness of Optimal Auctions. FOCS 2002: 396-405 - [c6]Ryan Porter, Amir Ronen, Yoav Shoham, Moshe Tennenholtz:
Mechanism Design with Execution Uncertainty. UAI 2002: 414-421 - 2001
- [j2]Noam Nisan, Amir Ronen:
Algorithmic Mechanism Design. Games Econ. Behav. 35(1-2): 166-196 (2001) - [c5]Amir Ronen:
On approximating optimal auctions. EC 2001: 11-17 - [c4]Amir Ronen:
Mechanism design with incomplete languages. EC 2001: 105-114 - 2000
- [b1]Amir Ronen:
Solving optimization problems among selfish agents (פתרון בעיות אופטימיזציה בקרב סוכנים אנוכיים.). Hebrew University of Jerusalem, Israel, 2000 - [c3]Noam Nisan
Computationally feasible VCG mechanisms. EC 2000: 242-252 - [c2]Amir Ronen:
Algorithms for Rational Agents. SOFSEM 2000: 56-70
1990 – 1999
- 1999
- [c1]Noam Nisan
Algorithmic Mechanism Design (Extended Abstract). STOC 1999: 129-140 - 1997
- [j1]Gad Aharoni, Amnon Barak, Amir Ronen:
A Competitive Algorithm for Managing Sharing in the Distributed Execution of Functional Programs. J. Funct. Program. 7(4): 421-440 (1997)
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-02 21:50 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: