Related papers: Slot-specific Priorities with Capacity Transfers

This paper addresses the issue of specifying, simulating, and verifying reactive systems in rewriting logic. It presents an executable semantics for probabilistic, timed, and spatial concurrent constraint programming -- here called…

The notion of 'resource' plays an important role in the overall efficiency and performance of most cross-docks. The processing time can often be described in terms of the resources allocated to different trucks. Conversely, for a given…

A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over…

We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for…

We consider linear orders of finite alternatives constructed by aggregating individual preferences. Specifically, we focus on linear orders that respect modified collective preference relations derived from supermajority rules, where…

In several matching markets, in order to achieve diversity, agents' priorities are allowed to vary across an institution's available seats, and the institution is let to choose agents in a lexicographic fashion based on a predetermined…

The classical theory of efficient allocations of an aggregate endowment in a pure-exchange economy has hitherto primarily focused on the Pareto-efficiency of allocations, under the implicit assumption that transfers between agents are…

This study develops a novel class of queueing game to explain a common practice in cargo shipping "Sail Fast, Then Wait" (SFTW), and demonstrates that resolving information asymmetry among ships can deconcentrate port arrival times. We…

We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for…

Advance reservation is important to guarantee the quality of services of jobs by allowing exclusive access to resources over a defined time interval on resources. It is a challenge for the scheduler to organize available resources…

Problem definition: In many matching markets, some agents are fully flexible, while others only accept a subset of jobs. For example, ridesharing drivers can specify on the platform the destinations they are willing to accept. Conventional…

We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to…

We formalize an allocation model under ordinal preferences that is more general than the well-studied Shapley-Scarf housing market. In our model, the agents do not just care which house or resource they get but also care about who gets…

We consider a committee voting on whether to adopt a reform under a quota rule, where members differ in how much they value the reform some supporting it, others opposing it. We examine how members can influence each other's votes through…

We consider the single-item single-stocking location stochastic inventory system under a fixed ordering cost component. A long-standing problem is that of determining the structure of the optimal control policy when this system is subject…

Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…

Westudy how a planner can design dynamic interventions to overcome status-quo inertia in living temporal games, where strategic agents control their state (active, sleep, partially dead) on a temporal network. Building on the…

We study stochastic team (known also as decentralized stochastic control or identical interest stochastic dynamic game) problems with large or countably infinite number of decision makers, and characterize existence and structural…

We consider a distribution logistics scenario where a shipping operator, managing a limited amount of resources, receives a stream of collection requests, issued by a set of customers along a booking time-horizon, that are referred to a…

In this work, we study the problem of online mechanism design for resources allocation and pricing in cloud computing (RAPCC). We show that in general the allocation problems in RAPCC are NP-hard, and therefore we focus on designing…