![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Nima Haghpanah
Person information
- unicode name: نيما حق پناه
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah
:
Sequential Mechanisms with Ex Post Individual Rationality. Oper. Res. 71(1): 245-258 (2023) - 2021
- [j7]Hu Fu, Nima Haghpanah, Jason D. Hartline, Robert Kleinberg
:
Full surplus extraction from samples. J. Econ. Theory 193: 105230 (2021) - [c14]Nima Haghpanah, Aditya Kuvalekar, Elliot Lipnowski:
Selling to a Group. EC 2021: 583-584 - 2020
- [j6]Nikhil R. Devanur, Nima Haghpanah
, Alexandros Psomas:
Optimal multi-unit mechanisms with private demands. Games Econ. Behav. 121: 482-505 (2020) - [i7]S. Nageeb Ali, Nima Haghpanah, Xiao Lin, Ron Siegel:
How to Sell Hard Information. CoRR abs/2010.08037 (2020)
2010 – 2019
- 2019
- [j5]Saeed Alaei
, Hu Fu, Nima Haghpanah
, Jason D. Hartline, Azarakhsh Malekian:
Efficient Computation of Optimal Auctions via Reduced Forms. Math. Oper. Res. 44(3): 1058-1086 (2019) - 2017
- [c13]Nikhil R. Devanur, Nima Haghpanah, Christos-Alexandros Psomas:
Optimal Multi-Unit Mechanisms with Private Demands. EC 2017: 41-42 - [i6]Nikhil R. Devanur, Nima Haghpanah, Christos-Alexandros Psomas:
Optimal Multi-Unit Mechanisms with Private Demands. CoRR abs/1704.05027 (2017) - 2016
- [c12]Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah:
Sequential Mechanisms with Ex-post Participation Guarantees. EC 2016: 213-214 - [i5]Itai Ashlagi, Constantinos Daskalakis, Nima Haghpanah:
Sequential Mechanisms with ex-post Participation Guarantees. CoRR abs/1603.07229 (2016) - 2015
- [j4]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. ACM Trans. Economics and Comput. 3(4): 18:1-18:16 (2015) - [c11]Nima Haghpanah, Jason D. Hartline:
Reverse Mechanism Design. EC 2015: 757-758 - 2014
- [c10]Hu Fu, Nima Haghpanah, Jason D. Hartline, Robert Kleinberg:
Optimal auctions for correlated buyers with sampling. EC 2014: 23-36 - [i4]Nima Haghpanah, Jason D. Hartline:
Reverse Mechanism Design. CoRR abs/1404.1341 (2014) - [i3]Hu Fu, Nima Haghpanah, Jason D. Hartline, Robert Kleinberg:
Optimal Auctions for Correlated Buyers with Sampling. CoRR abs/1406.1571 (2014) - 2013
- [j3]Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium pricing with positive externalities. Theor. Comput. Sci. 476: 1-15 (2013) - [j2]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala:
Optimal Auctions with Positive Network Externalities. ACM Trans. Economics and Comput. 1(2): 13:1-13:24 (2013) - [c9]Saeed Alaei
, Hu Fu, Nima Haghpanah, Jason D. Hartline:
The Simple Economics of Approximately Optimal Auctions. FOCS 2013: 628-637 - [c8]MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam:
Revenue Maximization with Nonexcludable Goods. WINE 2013: 40-53 - 2012
- [j1]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala:
How to approximate optimal auctions. SIGecom Exch. 11(1): 30-33 (2012) - [c7]Saeed Alaei
, Hu Fu, Nima Haghpanah, Jason D. Hartline, Azarakhsh Malekian:
Bayesian optimal auctions via multi- to single-agent reduction. EC 2012: 17 - [i2]Saeed Alaei, Hu Fu, Nima Haghpanah, Jason D. Hartline, Azarakhsh Malekian:
Bayesian Optimal Auctions via Multi- to Single-agent Reduction. CoRR abs/1203.5099 (2012) - [i1]Saeed Alaei, Hu Fu, Nima Haghpanah, Jason D. Hartline, Azarakhsh Malekian:
The Simple Economics of Approximately Optimal Auctions. CoRR abs/1206.3541 (2012) - 2011
- [c6]Nima Haghpanah, Nicole Immorlica, Vahab S. Mirrokni, Kamesh Munagala:
Optimal auctions with positive network externalities. EC 2011: 11-20 - 2010
- [c5]Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad:
Optimal Iterative Pricing over Social Networks (Extended Abstract). WINE 2010: 415-423 - [c4]Nima Anari
, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium Pricing with Positive Externalities (Extended Abstract). WINE 2010: 424-431
2000 – 2009
- 2008
- [c3]Nima Haghpanah, Masoud Akhoondi, Hassan Abolhassani:
Inferring Trust Using Relation Extraction in Heterogeneous Social Networks. CSICC 2008: 867-870 - 2007
- [c2]Nima Haghpanah, Shahrouz Moaven, Jafar Habibi, Mehdi Kargar, Soheil Hassas Yeganeh:
Approximation Algorithms for Software Component Selection Problem. APSEC 2007: 159-166 - [c1]Nima Haghpanah, Masoud Akhoondi, Mehdi Kargar, Ali Movaghar
:
Trusted secure routing for ad hoc networks. MOBIWAC 2007: 176-179
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint