Остановите войну!
for scientists:
default search action
Elan Pavlov
- > Home > Persons > Elan Pavlov
Publications
- 2009
- [j5]Moshe Babaioff, Noam Nisan, Elan Pavlov:
Mechanisms for a spatially distributed market. Games Econ. Behav. 66(2): 660-684 (2009) - [j4]Moshe Babaioff, Ron Lavi, Elan Pavlov:
Single-value combinatorial auctions and algorithmic implementation in undominated strategies. J. ACM 56(1): 4:1-4:32 (2009) - [c23]Rica Gonen, Elan Pavlov:
Adaptive Incentive-Compatible Sponsored Search Auction. SOFSEM 2009: 303-316 - 2007
- [c22]Rica Gonen, Elan Pavlov:
An incentive-compatible multi-armed bandit mechanism. PODC 2007: 362-363 - [c21]Mira Gonen, Rica Gonen, Elan Pavlov:
Generalized trade reduction mechanisms. EC 2007: 20-29 - [c20]Rica Gonen, Elan Pavlov:
An Adaptive Sponsored Search Mechanism delta -Gain Truthful in Valuation, Time, and Budget. WINE 2007: 341-346 - [c19]Mira Gonen, Rica Gonen, Elan Pavlov:
Characterizing Truthful Market Design. WINE 2007: 590-595 - 2006
- [c18]Moshe Babaioff, Ron Lavi, Elan Pavlov:
Impersonation-Based Mechanisms. AAAI 2006: 592-597 - [c16]Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan:
Fault-Tolerant Distributed Computing in Full-Information Networks. FOCS 2006: 15-26 - [c14]Moshe Babaioff, Ron Lavi, Elan Pavlov:
Single-value combinatorial auctions and implementation in undominated strategies. SODA 2006: 1054-1063 - [c13]Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan:
Byzantine agreement in the full-information model in O(log n) rounds. STOC 2006: 179-186 - 2005
- [j3]Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg:
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. SIAM J. Comput. 35(1): 120-131 (2005) - [c12]Moshe Babaioff, Ron Lavi, Elan Pavlov:
Mechanism Design for Single-Value Domains. AAAI 2005: 241-247 - 2004
- [c8]Moshe Babaioff, Noam Nisan, Elan Pavlov:
Mechanisms for a spatially distributed market. EC 2004: 9-20 - 2003
- [c7]Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, Elan Pavlov:
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. IPDPS 2003: 40 - [c6]Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg:
MST construction in O(log log n) communication rounds. SPAA 2003: 94-100 - 2002
- [c4]Dahlia Malkhi, Ofer Margo, Elan Pavlov:
E-Voting Without 'Cryptography'. Financial Cryptography 2002: 1-15 - 2001
- [c3]Dahlia Malkhi, Elan Pavlov:
Anonymity without 'Cryptography'. Financial Cryptography 2001: 108-126 - [c2]Dahlia Malkhi, Elan Pavlov, Yaron Sella:
Optimal Unconditional Information Diffusion. DISC 2001: 63-77
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 2023-11-13 23:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint