Congestion allocation for distributed networks: an experimental study
From MaRDI portal
Publication:2642889
DOI10.1007/S00199-007-0213-ZzbMATH Open1122.91045OpenAlexW2156646518MaRDI QIDQ2642889FDOQ2642889
Yan Chen, Theodore L. Turocy, Laura Razzolini
Publication date: 6 September 2007
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-007-0213-z
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Signaling and communication in game theory (91A28) Experimental studies (91A90)
Cites Work
- Three methods to share joint costs or surplus
- Serial Cost Sharing
- Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
- Average cost pricing versus serial cost sharing: An axiomatic comparison
- Payoff assessments without probabilities: a simple dynamic model of choice
- Evolving market structure: An ACE model of price dispersion and loyalty
- An experimental evaluation of the serial cost sharing rule
- Learning under limited information.
Cited In (4)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A distributed approach to capacity allocation in logical networks 👍 👎
- Dual decomposition method for optimal and fair congestion control in ad hoc networks: algorithm, implementation and evaluation 👍 👎
- Congestion control in compartmental network systems 👍 👎
- Towards experimental evaluation of explicit congestion control 👍 👎
- Congestion in large balanced multirate networks 👍 👎
This page was built for publication: Congestion allocation for distributed networks: an experimental study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642889)
