Advertisement

New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets

  • Deeparnab Chakrabarty
  • Nikhil Devanur
  • Vijay V. Vazirani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4286)

Abstract

We study the structure of EG[2], the class of Eisenberg-Gale markets with two agents. We prove that all markets in this class are rational and they admit strongly polynomial algorithms whenever the polytope containing the set of feasible utilities of the two agents can be described via a combinatorial LP. This helps resolve positively the status of two markets left as open problems by [JV]: the capacity allocation market in a directed graph with two source-sink pairs and the network coding market in a directed network with two sources.

Our algorithms for solving the corresponding nonlinear convex programs are fundamentally different from those obtained by [JV]; whereas they use the primal-dual schema, we use a carefully constructed binary search.

Keywords

Polynomial Time Equilibrium Price Polynomial Time Algorithm Binary Search Polynomial Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BV04]
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)MATHGoogle Scholar
  2. [CDV]
    Chakrabarty, D., Devanur, N., Vazirani, V.V.: Eisenberg-gale markets: Rationality, strongly polynomial time solvability and competition monotonicity (manuscript), Available from: http://www.cc.gatech.edu/~nikhil/
  3. [DJP+94]
    Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 23, 864–894 (1994)MATHCrossRefMathSciNetGoogle Scholar
  4. [DPS02]
    Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In: Proceedings of ACM Symposium on Theory of Computing (2002)Google Scholar
  5. [EFS56]
    Elias, P., Feinstein, A., Shannon, C.E.: Note on maximum flow through a network. IRE Transactions on Information Theory IT-2, 117–199 (1956)CrossRefGoogle Scholar
  6. [EG59]
    Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the Pari-Mutuel method. The Annals of Mathematical Statistics 30, 165–168 (1959)MATHCrossRefMathSciNetGoogle Scholar
  7. [FF56]
    Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics, 99–404 (1956)Google Scholar
  8. [GJTV05]
    Garg, D., Jain, K., Talwar, K., Vazirani, V.: A primal-dual algorithm for computing Fisher equilibrium in absence of gross substitutability property. In: Proceedings of wine (2005)Google Scholar
  9. [GVY94]
    Garg, N., Vazirani, V.V., Yannakakis, M.: Multiway cuts in directed and node weighted graphs. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol. 820, pp. 487–498. Springer, Heidelberg (1994)Google Scholar
  10. [Hu63]
    Hu, T.C.: Multicommodity network flows. Operations Research 14, 344–360 (1963)CrossRefGoogle Scholar
  11. [JV]
    Jain, K., Vazirani, V.V.: Combinatorial solvability in resource allocation markets, with applications to efficiency and fairness (manuscript, 2005), Available from: http://www.cc.gatech.edu/~vazirani/
  12. [Kel97]
    Kelly, F.P.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)CrossRefGoogle Scholar
  13. [NW61]
    Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445–450 (1961)MATHCrossRefMathSciNetGoogle Scholar
  14. [Tar86]
    Tardos, E.: A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34(2), 250–256 (1986)MATHCrossRefMathSciNetGoogle Scholar
  15. [Tut61]
    Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36, 221–230 (1961)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Deeparnab Chakrabarty
    • 1
  • Nikhil Devanur
    • 1
  • Vijay V. Vazirani
    • 1
  1. 1.College of ComputingGeorgia Institute of TechnologyAtlanta

Personalised recommendations