IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v241y2016i1d10.1007_s10479-014-1534-5.html
   My bibliography  Save this article

Generating approximate parametric roots of parametric polynomials

Author

Listed:
  • B. Curtis Eaves

    (Stanford University)

  • Uriel G. Rothblum

    (Technion—Israel Institute of Technology)

Abstract

Built upon a ground field is the parametric field, the Puiseux field, of semi-terminating formal fractional power series. A parametric polynomial is a polynomial with coefficients in the parametric field, and roots of parametric polynomials are parametric. For a parametric polynomial with nonterminating parametric coefficients and a target accuracy, using sensitivity of the Newton Polygon process, a complete set of approximate parametric roots, each meeting target accuracy, is generated. All arguments are algebraic, from the inside out, self-contained, penetrating, and uniform in that only the Newton Polygon process is used, for both preprocessing and intraprocessing. A complexity analysis over ground field operations is developed; setting aside root generation for ground field polynomials, but bounding such, polynomial bounds are established in the degree of the parametric polynomial and the target accuracy.

Suggested Citation

  • B. Curtis Eaves & Uriel G. Rothblum, 2016. "Generating approximate parametric roots of parametric polynomials," Annals of Operations Research, Springer, vol. 241(1), pages 515-573, June.
    • Handle: RePEc:spr:annopr:v:241:y:2016:i:1:d:10.1007_s10479-014-1534-5
    DOI: 10.1007/s10479-014-1534-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1534-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-014-1534-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. B. Curtis Eaves & Uriel G. Rothblum, 1989. "A Theory on Extending Algorithms for Parametric Problems," Mathematics of Operations Research, INFORMS, vol. 14(3), pages 502-533, August.
    2. Truman Bewley & Elon Kohlberg, 1976. "The Asymptotic Theory of Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 1(3), pages 197-208, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Eilon Solan & Nicolas Vieille, 2010. "Computing uniformly optimal strategies in two-player stochastic games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 237-253, January.
    2. Levy, Yehuda John, 2022. "Uniformly supported approximate equilibria in families of games," Journal of Mathematical Economics, Elsevier, vol. 98(C).
    3. Solan, Eilon & Vieille, Nicolas, 2002. "Correlated Equilibrium in Stochastic Games," Games and Economic Behavior, Elsevier, vol. 38(2), pages 362-399, February.
    4. Johannes Hörner & Satoru Takahashi & Nicolas Vieille, 2015. "Truthful Equilibria in Dynamic Bayesian Games," Econometrica, Econometric Society, vol. 83(5), pages 1795-1848, September.
    5. Abraham Neyman, 2001. "Real Algebraic Tools in Stochastic Games," Discussion Paper Series dp272, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    6. Jérôme Renault & Xavier Venel, 2017. "Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 349-376, May.
    7. Vladimir Ejov & Jerzy Filar, 2006. "Gröbner bases in Asymptotic Analysis of Perturbed Polynomial Programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 1-16, August.
    8. Xiaoxi Li & Xavier Venel, 2016. "Recursive games: Uniform value, Tauberian theorem and the Mertens conjecture " M axmin = lim v n = lim v λ "," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01302553, HAL.
    9. Miquel Oliu-Barton, 2021. "New Algorithms for Solving Zero-Sum Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 255-267, February.
    10. Abraham Neyman, 2013. "Stochastic Games with Short-Stage Duration," Dynamic Games and Applications, Springer, vol. 3(2), pages 236-278, June.
    11. Hansen, Kristoffer Arnsfelt & Ibsen-Jensen, Rasmus & Neyman, Abraham, 2021. "Absorbing games with a clock and two bits of memory," Games and Economic Behavior, Elsevier, vol. 128(C), pages 213-230.
    12. B. Curtis Eaves & Uriel G. Rothblum, 2014. "An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 607-623, August.
    13. Eilon Solan, 2003. "Continuity of the Value of Competitive Markov Decision Processes," Journal of Theoretical Probability, Springer, vol. 16(4), pages 831-845, October.
    14. Miquel Oliu-Barton, 2014. "The Asymptotic Value in Finite Stochastic Games," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 712-721, August.
    15. Levy, Yehuda, 2012. "Stochastic games with information lag," Games and Economic Behavior, Elsevier, vol. 74(1), pages 243-256.
    16. Dmitry Khlopin, 2018. "Tauberian Theorem for Value Functions," Dynamic Games and Applications, Springer, vol. 8(2), pages 401-422, June.
    17. Renault, Jérôme & Ziliotto, Bruno, 2020. "Hidden stochastic games and limit equilibrium payoffs," Games and Economic Behavior, Elsevier, vol. 124(C), pages 122-139.
    18. Ziliotto, Bruno, 2018. "Tauberian theorems for general iterations of operators: Applications to zero-sum stochastic games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 486-503.
    19. Yuichi Yamamoto, 2015. "Stochastic Games with Hidden States," PIER Working Paper Archive 15-007, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    20. F. Thuijsman & O. J. Vrieze, 1998. "Total Reward Stochastic Games and Sensitive Average Reward Strategies," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 175-196, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:241:y:2016:i:1:d:10.1007_s10479-014-1534-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.