Contemporary networks are distributed, complex, and heterogeneous. Ensuring an efficient, fair, and incentive-compatible allocation of bandwidth among their users constitutes a challenging and multi-faceted research problem. This chapter presents three control and game-theoretic approaches that address rate control problems from different perspectives. First, a noncooperative rate control game ...

Standard incentive theory models provide a rich framework for studying informational problems but assume that contracts can be perfectly enforced. This paper studies the design of self-enforced relational contracts. I show that optimal contracts often can take a simple stationary form, but that self-enforcement restricts promised compensation and affects incentive provision. With hidden informa...

The survey tries to review the various problems and their solution in Delay Tolerant Network (DTN) while routing the packets. In this paper, going to discuss and see the overview of various methods used in the DTN. They are simbet and bubble rap which are the DTN routing algorithm and is used for identify the bridge nodes using betweenness centrality and similarity metrics in the network. Then ...

This paper considers the incentive compatibility in many-to-many two-sided matching problems. We first show that the Blocking Lemma holds for many-to-many matchings under the extended max-min preference criterion and quota-saturability condition. This result extends the Blocking Lemma for one-to-one matching and for many-to-one matching to many-to-many matching problem. It is then shown that th...

We explore the implications of consistency in sequencing problems. We first identify all rules satisfying Pareto indifference, individual rationality, and consistency. Next, we ask whether there is a rule satisfying the three axioms together with either one of two additional own-time monotonicity requirements: an agent should lose (or gain) as a result of changes in his service time. As it turn...

Free riding, the behavior of attempting to benefit resources contributed by others while sharing their own values as minimum as possible, is one of the key problems in many P2P systems. Incentive mechanisms are proposed to solve the problem. In this paper, we introduce an all-pay auction model to study the resource distribution process in BitTorrent-like P2P system. Based on this model, the adv...

Consider a supply chain in which a product must pass through multiple sites located in series before it is finally delivered to outside customers. Incentive problems may arise in this system when decisions are delegated to corresponding site managers, each maximizing his/her own performance metric. From the overall system’s point of view, the decentralized supply chain may not be as efficient a...

We investigate the problem of repacking stations in the FCC’s upcoming, multi-billion-dollar “incentive auction”. Early efforts to solve this problem considered mixed-integer programming formulations, which we show are unable to reliably solve realistic, national-scale problem instances. We describe the result of a multi-year investigation of alternatives: a solver, SATFC, that has been adopted...

In certain interorganizational system (IOS) adoptions, IOS initiators have incentives to exploit the full benefit to their trading partners once the partners implement the IOS. This is termed ex post opportunistic behavior on the part of the initiator. The anticipated ex post opportunistic behavior of the initiator can deter the trading partner’s ex ante IOS adoption decision, which prevents th...

Affordable housing is of much importance for Chinese subsidized housing. However, the implementation of the affordable housing policy is facing several problems. One crucial problem is that the current policy cannot effectively identify high-income applicants who are not qualified to apply for affordable housing. Based on the theory of incentive mechanism design, this paper reveals that the cur...