Related papers: Combinatorial Cost Sharing
We introduce a novel approach to reduce the computational effort of solving mixed-integer convex chance constrained programs through the scenario approach. Instead of reducing the number of required scenarios, we directly minimize the…
We introduce a two-agent problem which is inspired by price asymmetry arising from funding difference. When two parties have different funding rates, the two parties deduce different fair prices for derivative contracts even under the same…
We study allocation mechanisms that utilize costly signaling as a screening tool. A social planner aims to maximize social welfare, defined as the weighted sum of agents' utilities, while implementing a specific allocation rule. Within a…
We consider a sharing economy network where agents embedded in a graph share their resources. This is a fundamental model that abstracts numerous emerging applications of collaborative consumption systems. The agents generate a random…
Coalitional control is concerned with the management of multi-agent systems where cooperation cannot be taken for granted (due to, e.g., market competition, logistics). This paper proposes a model predictive control (MPC) framework aimed at…
This paper focuses on managing the cost of deliberation before action. In many problems, the overall quality of the solution reflects costs incurred and resources consumed in deliberation as well as the cost and benefit of execution, when…
We introduce a new class of combinatorial markets in which agents have covering constraints over resources required and are interested in delay minimization. Our market model is applicable to several settings including scheduling, cloud…
Identical products being sold at different prices in different locations is a common phenomenon. Price differences might occur due to various reasons such as shipping costs, trade restrictions and price discrimination. To model such…
In sponsored content and service markets, the content and service providers are able to subsidize their target mobile users through directly paying the mobile network operator, to lower the price of the data/service access charged by the…
We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the problem when the principal's utility function is submodular…
This paper studies the application of the blended dynamics approach towards distributed optimization problem where the global cost function is given by a sum of local cost functions. The benefits include (i) individual cost function need…
A mobile cloud computing system is composed of heterogeneous services and resources to be allocated by the cloud service provider to mobile cloud users. On one hand, some of these resources are substitutable (e.g., users can use storage…
This paper addresses the optimization problem to maximize the total costs that can be shared among a group of agents, while maintaining stability in the sense of the core constraints of a cooperative transferable utility game, or TU game.…
We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to…
We study a simple problem of allocating common-value goods. The designer seeks to allocate the goods to as many unit-demand agents as possible without monetary transfers, while agents, who possess partial private information about the…
Duality for robust hedging with proportional transaction costs of path dependent European options is obtained in a discrete time financial market with one risky asset. Investor's portfolio consists of a dynamically traded stock and a static…
In this study, a cooperative game model is presented to schedule the day-ahead operation of multi-microgrid (MMG) systems. In the proposed model, microgrids are scheduled to achieve a global optimum for the cost of the multi-microgrid…
The combinatorial pricing problem (CPP) is a bilevel problem in which the leader maximizes their revenue by imposing tolls on certain items that they can control. Based on the tolls set by the leader, the follower selects a subset of items…
Suppose some objects are hidden in a finite set $S$ of hiding places which must be examined one-by-one. The cost of searching subsets of $S$ is given by a submodular function and the probability that all objects are contained in a subset is…
We discuss the issue of distributed and cooperative decision-making in a network game of public service location. Each node of the network can choose to be a provider of service which is accessible to the provider itself and also to all the…