Related papers: Market Pricing for Matroid Rank Valuations
We consider the optimization problem of a multi-resource, multi-unit VCG auction that produces an optimal, i.e., non-approximated, social welfare. We present an algorithm that solves this optimization problem with pseudo-polynomial…
The matroid-based valuation conjecture of Ostrovsky and Paes Leme states that all gross substitutes valuations on $n$ items can be produced from merging and endowments of weighted ranks of matroids defined on at most $m(n)$ items. We show…
Renewable sources are taking center stage in electricity generation. However, matching supply with demand in a renewable-rich system is a difficult task due to the intermittent nature of renewable resources (wind, solar, etc.). As a result,…
We study a natural generalization of stable matching to the maximum weight stable matching problem and we obtain a combinatorial polynomial time algorithm for it by reducing it to the problem of finding a maximum weight ideal cut in a DAG.…
It was recently shown in [http://arxiv.org/abs/1207.5518] that revenue optimization can be computationally efficiently reduced to welfare optimization in all multi-dimensional Bayesian auction problems with arbitrary (possibly…
In revenue maximization of selling a digital product in a social network, the utility of an agent is often considered to have two parts: a private valuation, and linearly additive influences from other agents. We study the incomplete…
Recent trends express the impact of prosumers and small energy resources and storages in distribution systems, due to the increasing uptake of renewable resources. This research studies the effect of coordination of distributed resources…
The Rank Pricing Problem (RPP) is a challenging bilevel optimization problem with binary variables whose objective is to determine the optimal pricing strategy for a set of products to maximize the total benefit, given that customer…
Serial dictatorship is a simple mechanism for coordinating agents in solving combinatorial optimization problems according to their preferences. The most representative such problem is one-sided matching, in which a set of n agents have…
With spectrum auctions as our prime motivation, in this paper we analyze combinatorial auctions where agents' valuations exhibit complementarities. Assuming that the agents only value bundles of size at most $k$ and also assuming that we…
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general…
This paper studies the problem of optimally allocating treatments in the presence of spillover effects, using information from a (quasi-)experiment. I introduce a method that maximizes the sample analog of average social welfare when…
We consider class of equilibrium models including the implicit Walras supply-demand and competitive models. Such a model in this class, in general, is ill-posed. We formulate such a model in the form a variational inequality having certain…
In many settings agents participate in multiple different auctions that are not necessarily implemented simultaneously. Future opportunities affect strategic considerations of the players in each auction, introducing externalities.…
We introduce the concept of multilevel fair allocation of resources with tree-structured hierarchical relations among agents. While at each level it is possible to consider the problem locally as an allocation of an agent to its children,…
We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for…
We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In…
We investigate whether preferences for objects received via a matching mechanism are influenced by how highly agents rank them in their reported rank order list. We hypothesize that all else equal, agents receive greater utility for the…
The evolution of smart microgrid and its demand-response characteristics not only will change the paradigms of the century-old electric grid but also will shape the electricity market. In this new market scenario, once always energy…
We propose a pseudo-market solution to resource allocation problems subject to constraints. Our treatment of constraints is general: including bihierarchical constraints due to considerations of diversity in school choice, or scheduling in…