The paper reports the approach of our team “711” to recommend Brick-and-Mortar Store with Budget Constraints. By extensive studies, we find that the history data is very effective in this location based service recommendation and we exploit the history data in our recommendation from both the users’ aspect and the merchants’ aspect. Moreover, we extract predicative features from the train set a...

Motivated by sponsored search auctions, we study multi-unit auctions with budget constraints. In the mechanism we propose, Sort-Cut, understating budgets or values is weakly dominated. Since Sort-Cut’s revenue is increasing in budgets and values, all kinds of equilibrium deviations from true valuations turn out to be bene…cial to the auctioneer. We show that the revenue of Sort-Cut can be an or...

We study the infinitely many-armed bandit problem with budget constraints, where the number of arms can be infinite and much larger than the number of possible experiments. The player aims at maximizing his/her total expected reward under a budget constraint B for the cost of pulling arms. We introduce a weak stochastic assumption on the ratio of expected-reward to expected-cost of a newly pull...

We investigate markets with a set of students on one side and a set of colleges on the other. A student and college can be linked by a weighted contract that defines the student’s wage, while a college’s budget for hiring students is limited. Stability is a crucial requirement for matching mechanisms to be applied in the real world. A standard stability requirement is coalitional stability, i.e...

We study a keyword auction model where bidders have constrained budgets. In the absence of budget constraints, Edelman, Ostrovsky, and Schwarz (2007) and Varian (2007) analyze “locally envy-free equilibrium” or “symmetric Nash equilibrium” bidding strategies in generalized second-price (GSP) auctions. However, bidders often have to set their daily budgets when they participate in an auction; on...

Given a tree T (V, E) endowed with a length function l and a cost function c, the diameter lowering problem consists in finding the reals 0 ≤ x(e) ≤ l(e), e E such that the tree obtained from T by decreasing the length of every edge e by x(e) units has a minimal diameter subject to the constraint ¥e Ec(e)x(e) ≤ B, where B is the available budget (analogously, one can minimize the cost of loweri...

This paper addresses the existence of competitive equilibrium in the variant of the Assignment Game where budget-constrained agents are endowed with one good, that can be sold to buy another good. We define the Money Scarcity (MS) condition and its Strong (SMS) and Weak (WMS) versions. The WMS condition ensures the existence of an equilibrium in cases where Quinzii’s indispensability of money a...

We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph H = (B,S). Vertices in B are thought of as goods or services that must be bought to produce items in S that are to be sold. An edge from j ∈ S to i ∈ B indicates that the production of j requires the purchase of i. Ea...

This paper studies combinatorial auctions with budget-constrained bidders from a mechanism design perspective. I search for mechanisms that are incentive compatible, individually rational, symmetric, nonwasteful and non-bossy. First focusing on the greedy domain, in which any increase in a bidder’s valuation always exceeds his budget, I derive the unique mechanism, called the Iterative Second P...

We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in order to reduce the computational cost of prediction while maintaining predictio...