7 citations · 12 across the 14 of their papers we have counts for
15 papers
NoLBERT: A No Lookahead(back) Foundational Language Model
Ali Kakhbod, Peiyao Li
We present NoLBERT, a lightweight, timestamped foundational language model for empirical research -- particularly for forecasting in economics, finance, and the social sciences. By…
Selling Wind
Ali Kakhbod, Asuman Ozdaglar, Ian Schneider
We offer a parsimonious model to investigate how strategic wind producers sell energy under stochastic production constraints, where the extent of heterogeneity of wind energy avai…
A Taxation Policy for Maximizing Social Welfare in Networks: A General Framework
Ali Kakhbod, Joseph Koo, Demosthenis Teneketzis
We present a simple tatonnement process based on a decomposition method which is simple to implement and achieves the maximal social welfare, under the assumption that the utility…
Market Mechanisms with Non-Price-Taking Agents
Ali Kakhbod
The paper develops a decentralized resource allocation mechanism for allocating divisible goods with capacity constraints to non-price-taking agents with general concave utilities.…
Resource allocation with costly participation
Ali Kakhbod
We propose a new all-pay auction format in which risk-loving bidders pay a constant fee each time they bid for an object whose monetary value is common knowledge among the bidders,…
An Efficient Tatonnement Process for the Public Good Problem
Ali Kakhbod, Joseph Koo, Demosthenis Teneketzis
We present a decentralized message exchange process (tatonnement process) for determining the level at which a certain public good will be provided to a set of individuals who fina…
Revenue Maximization in Spectrum Auctions for Dynamic Spectrum Access
Ali Kakhbod, Ashutosh Nayyar, Demosthenis Teneketzis
We investigate revenue maximization problems in auctions for dynamic spectrum access. We consider the frequency division and spread spectrum methods of dynamic spectrum sharing. In…
Power Allocation and Spectrum Sharing in Multi-User, Multi-Channel Systems with Strategic Users
Ali Kakhbod, Demosthenis Teneketzis
We consider the decentralized power allocation and spectrum sharing problem in multi-user, multi-channel systems with strategic users. We present a mechanism/game form that has the…
On Describing the Routing Capacity Regions of Networks
Ali Kakhbod, S. M. Sadegh Tabatabaei Yazdi
The routing capacity region of networks with multiple unicast sessions can be characterized using Farkas' lemma as an infinite set of linear inequalities. In this paper this result…
Finding an Integral vector in an Unknown Polyhedral Cone
Ali Kakhbod, Morteza Zadimoghaddam
We present an algorithm to find an integral vector in the polyhedral cone , without assuming the explicit knowledge of . About th…
On the Construction of Prefix-Free and Fix-Free Codes with Specified Codeword Compositions
Ali Kakhbod, Morteza Zadimoghaddam
We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with…
Games on Social Networks: On a Problem Posed by Goyal
Ali Kakhbod, Demosthenis Teneketzis
Within the context of games on networks S. Goyal (Goya (2007), pg. 39) posed the following problem. Under any arbitrary but fixed topology, does there exist at least one pure Nash…
Correction to "An Efficient Game Form for Unicast Service Provisioning"
Ali Kakhbod, Demosthenis Teneketzis
A correction to the specification of the mechanism proposed in "An Efficient Game Form for Unicast Service Provisioning" is given.
Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes
Soheil Mohajer, Ali Kakhbod
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of t…
Tight Bounds on the Redundancy of Huffman Codes
Soheil Mohajer, Payam Pakzad, Ali Kakhbod
In this paper we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of…