default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Kakhbod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Ali Kakhbod, Fei Song:
Dynamic price discovery: Transparency vs. information design. Games Econ. Behav. 122: 203-232 (2020)
2010 – 2019
- 2019
- [j14]Ali Jadbabaie, Ali Kakhbod:
Optimal contracting in networks. J. Econ. Theory 183: 1094-1153 (2019) - 2018
- [j13]Amir Ajorlou, Ali Jadbabaie, Ali Kakhbod:
Dynamic Pricing in Social Networks: The Word-of-Mouth Effect. Manag. Sci. 64(2): 971-979 (2018) - 2015
- [j12]Ali Kakhbod, Demosthenis Teneketzis:
Correction to "An Efficient Game Form for Unicast Service Provisioning". IEEE Trans. Autom. Control. 60(2): 584-585 (2015) - 2014
- [j11]Amir Ajorlou, Ali Jadbabaie, Ali Kakhbod:
Strategic Information Diffusion: Spread vs. Exploit. SIGMETRICS Perform. Evaluation Rev. 42(3): 20-23 (2014) - 2013
- [j10]Ali Kakhbod, Demosthenis Teneketzis:
Correction to "An Efficient Game Form for Multi-Rate Multicast Service Provisioning". IEEE J. Sel. Areas Commun. 31(7): 1355-1356 (2013) - [j9]Ali Kakhbod:
Pay-to-bid auctions: To bid or not to bid. Oper. Res. Lett. 41(5): 462-467 (2013) - 2012
- [j8]Ali Kakhbod, Demosthenis Teneketzis:
An Efficient Game Form for Multi-Rate Multicast Service Provisioning. IEEE J. Sel. Areas Commun. 30(11): 2093-2104 (2012) - [j7]Ali Kakhbod, Demosthenis Teneketzis:
An Efficient Game Form for Unicast Service Provisioning. IEEE Trans. Autom. Control. 57(2): 392-404 (2012) - [j6]Ali Kakhbod, Demosthenis Teneketzis:
Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems With Strategic Users. IEEE Trans. Autom. Control. 57(9): 2338-2342 (2012) - [j5]Soheil Mohajer, Payam Pakzad, Ali Kakhbod:
Tight Bounds on the Redundancy of Huffman Codes. IEEE Trans. Inf. Theory 58(11): 6737-6746 (2012) - 2011
- [j4]Ali Kakhbod, Morteza Zadimoghaddam:
On the construction of prefix-free and fix-free codes with specified codeword compositions. Discret. Appl. Math. 159(18): 2269-2275 (2011) - [j3]Soheil Mohajer, Ali Kakhbod:
Anti-uniform huffman codes. IET Commun. 5(9): 1213-1219 (2011) - [c8]Ali Kakhbod, Ashutosh Nayyar, Demosthenis Teneketzis:
Revenue maximization in spectrum auction for dynamic spectrum access. VALUETOOLS 2011: 558-564 - [i9]Ali Kakhbod:
Resource Allocation with Costly Participation. CoRR abs/1108.2018 (2011) - [i8]Ali Kakhbod:
Market Mechanisms with Non-Price-Taking Agents. CoRR abs/1108.2728 (2011) - [i7]Ali Kakhbod, Demosthenis Teneketzis:
An Efficient Game Form for Multi-rate Multicast Service Provisioning. CoRR abs/1111.7013 (2011) - 2010
- [j2]Ali Kakhbod, S. M. Sadegh Tabatabaei Yazdi:
On describing the routing capacity regions of networks. Math. Methods Oper. Res. 72(1): 95-106 (2010) - [c7]Ali Kakhbod, Demosthenis Teneketzis:
Power allocation and spectrum sharing in multi-user, multi-channel systems with strategic users. CDC 2010: 1088-1095 - [i6]Ali Kakhbod, Demosthenis Teneketzis:
Games on Social Networks: On a Problem Posed by Goyal. CoRR abs/1001.3896 (2010) - [i5]Ali Kakhbod, Morteza Zadimoghaddam:
On the Carter-Gill Conjecture. CoRR abs/1002.0097 (2010) - [i4]Ali Kakhbod, S. M. Sadegh Tabatabaei Yazdi:
On Describing the Routing Capacity Regions of Networks. CoRR abs/1004.1236 (2010) - [i3]Ali Kakhbod, Demosthenis Teneketzis:
Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems with Strategic Users. CoRR abs/1006.0195 (2010)
2000 – 2009
- 2009
- [c6]Ali Kakhbod, Demosthenis Teneketzis:
An individually rational, budget-balanced mechanism that implements in Nash equilibria the solution of the unicast service provisioning problem. Allerton 2009: 1377-1386 - 2008
- [c5]Ali Kakhbod, Serap A. Savari, S. M. Sadegh Tabatabaei Yazdi:
A study of the routing capacity regions of networks. ACSCC 2008: 2226-2230 - [c4]Soheil Mohajer, Ali Kakhbod:
Tight bounds on the AUH codes. CISS 2008: 1010-1014 - [c3]Ali Kakhbod, Ali Nazari
, Morteza Zadimoghaddam:
Some notes on fix-free codes. CISS 2008: 1015-1018 - 2007
- [j1]Morteza Esmaeili, Ali Kakhbod:
On information theory parameters of infinite anti-uniform sources. IET Commun. 1(5): 1039-1041 (2007) - [i2]Soheil Mohajer, Ali Kakhbod:
Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes. CoRR abs/0706.3480 (2007) - 2006
- [c2]Morteza Esmaeili, Ali Kakhbod:
On Antiuniform And Partially Antiuniform Sources. ICC 2006: 1611-1615 - [c1]Soheil Mohajer, Payam Pakzad, Ali Kakhbod:
Tight Bounds on the Redundancy of Huffman Codes. ITW 2006: 131-135 - 2005
- [i1]Soheil Mohajer, Payam Pakzad, Ali Kakhbod:
Tight Bounds on the Redundancy of Huffman Codes. CoRR abs/cs/0508039 (2005)
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-10-24 21:33 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:
