NDLI: Pricing traffic in a spanning network

Please wait, while we are loading the content...

On the complexity of nash dynamics and sink equilibria

Limited and online supply and the bayesian foundations of prior-free mechanism design

Characterizing truthful multi-armed bandit mechanisms: extended abstract

Eliciting truthful answers to multiple-choice questions

Optimal collusion-resistant mechanisms with verification

Approximate mechanism design without money

Managing the quality of CPC traffic

Information aggregation in dynamic markets with strategic traders

The price of uncertainty

Social influence and the diffusion of user-created content

On representing coalitional games with externalities

Computational analysis of perfect-information position auctions

Self-correcting sampling-based dynamic multi-unit auctions

Crowdsourcing and all-pay auctions

But who will monitor the monitor?

On random sampling auctions for digital goods

Simple versus optimal mechanisms

A unified framework for dynamic pari-mutuel information market design

Policy teaching through reward function learning

Social lending

Pricing traffic in a spanning network

Selling ad campaigns: online algorithms with cancellations

The price of truthfulness for pay-per-click auctions

Designing incentives for online question and answer forums

Network bargaining: algorithms and structural results

A qualitative vickrey auction

Efficiency of (revenue-)optimal mechanisms

Collective revelation: a mechanism for self-verified, weighted, and truthful predictions

The price of anarchy in bertrand games

Sybilproof transitive trust protocols

A new perspective on implementation by voting trees

The adwords problem: online keyword matching with budgeted bidders under random permutations

Bayes-nash equilibria of the generalized second price auction

Substitutes or complements: another step forward in recommendations

An optimal lower bound for anonymous scheduling mechanisms

Destroy to save

Revenue submodularity

Modeling volatility in prediction markets

On the price of mediation

An exact almost optimal algorithm for target set selection in social networks

Pricing traffic in a spanning network

Content Provider	ACM Digital Library
Author	Moulin, Hervé
Abstract	Each user of the network needs to connect a pair of target nodes. There are no variable congestion costs, only a direct connection cost for each pair of nodes. A centralized mechanism elicits target pairs from users, and builds the cheapest forest meeting all demands. We look for cost sharing rules satisfying • Routing-proofness: no user can lower its cost by reporting as several users along an alternative path connecting his target nodes; • Stand Alone core stability: no group of users pay more than the cost of a subnetwork meeting all connection needs of the group. We construct first two core stable and routing-proof rules when connecting costs are all 0 or 1. One is derived from the random spanning tree weighted by the volume of traffic on each edge; the other is the weighted Shapley value of the Stand Alone cooperative game. For arbitrary connecting costs, we prove that the core is non empty if the graph of target pairs connects all pairs of nodes. Then we extend both rules above by the piecewise-linear technique. The former rule is computable in polynomial time, the latter is not.
Starting Page	21
Ending Page	30
Page Count	10
File Format	PDF
ISBN	9781605584584
DOI	10.1145/1566374.1566378
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-07-06
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Cost sharing rules Network design Routing-proofness Minimal cost spanning forest Core stability
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Pricing traffic in spanning network (2009)

Cost sharing mechanisms for near-optimal traffic aggregation and network design

Cost Effective Architectures for Core Transport Networks

A monotonic and merge-proof rule in minimum cost spanning tree situations

A Mechanism for Constructing the Minimum Cost Multicast Routing Tree

Time-Dependent Network Pricing and Bandwidth Trading

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

Network equilibrium with mixed behavior

Improved bounds on the price of stability in network cost sharing games

Pricing traffic in a spanning network

Similar Documents

Pricing traffic in spanning network (2009)

Cost sharing mechanisms for near-optimal traffic aggregation and network design

Cost Effective Architectures for Core Transport Networks

A monotonic and merge-proof rule in minimum cost spanning tree situations

A Mechanism for Constructing the Minimum Cost Multicast Routing Tree

Time-Dependent Network Pricing and Bandwidth Trading

A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

Network equilibrium with mixed behavior

Improved bounds on the price of stability in network cost sharing games

Pricing traffic in a spanning network