Zobrazeno 1 - 10
of 77
pro vyhledávání: '"A.J.J. Talman"'
Publikováno v:
Journal of Optimization Theory and Applications, 177(2), 399-412. SPRINGER/PLENUM PUBLISHERS
Since 1909 when Brouwer proved the first fixed-point theorem named afterhim, the fixed-point results in various settings play an important role in the optimization theory and applications. This technique has proven to be indispensable for the proofs
Publikováno v:
2018 International Conference on Unconventional Modelling, Simulation and Optimization - Soft Computing and Meta Heuristics - UMSO.
The paper develops the extensions of both the antipodal (Borsuk–Ulam) theorem and Browder theorem to the cases embracing star-shaped domains of the studied mappings and a multi-valued nature of the latter.To be more specific, by making use of the t
Publikováno v:
Annals of Operations Research, 211(1), 27-36. Springer
This paper analyzes the problem of selecting a set of items whose prices are to be updated in the next iteration in so called simple ascending auctions with unit-demand bidders. A family of sets called “sets in excess demand” is introduced, and t
Publikováno v:
Journal of Optimization Theory and Applications, 144, 391-407. Springer New York
Journal of Optimization Theory and Applications, 144, 391-407. SPRINGER/PLENUM PUBLISHERS
van der Laan, G, Talman, A J J & Yang, Z 2010, ' Combinatorial integer labeling theorems on finite sets with applications ', Journal of Optimization Theory and Applications, vol. 144, pp. 391-407 . https://doi.org/10.1007/s10957-009-9603-7
Journal of Optimization Theory and Applications, 144, 391-407. SPRINGER/PLENUM PUBLISHERS
van der Laan, G, Talman, A J J & Yang, Z 2010, ' Combinatorial integer labeling theorems on finite sets with applications ', Journal of Optimization Theory and Applications, vol. 144, pp. 391-407 . https://doi.org/10.1007/s10957-009-9603-7
Tucker's well-known combinatorial lemma states that, for any given sym- metric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {±1, ±2 ,..., ±n} with t
Autor:
Zaifu Yang, A.J.J. Talman
Publikováno v:
Economics Letters. 99:278-281
A number of heterogeneous items are to be sold to several bidders. Each bidder demands at most one item. The price of each item is not completely flexible and is restricted to some admissible interval. In such a market economy with price rigidities,
Autor:
Zaifu Yang, A.J.J. Talman
Publikováno v:
Mathematical Programming. 118:317-325
We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh s
Autor:
A.J.J. Talman, Jacco Thijssen
Publikováno v:
Journal of Mathematical Economics. 42:255-268
In this paper the standard two-period general equilibrium model with incomplete financial markets is considered. First, existence of equilibrium is proved using a stationary point argument on the set of no-arbitrage prices. Prices are normalised with
Autor:
Yoshitsugu Yamamoto, A.J.J. Talman
Publikováno v:
SIAM Journal on Optimization. 14:1128-1139
Let X be a nonempty, compact and convex set in Rn and $\phi$ be an outer semicontinuous mapping from X to the collection of nonempty, compact convex subsets of Rn. We show that for any nonzero vector c in Rn there exists a set of stationary points of
Publikováno v:
van den Brink, J R, Herings, J J, van der Laan, G & Talman, D 2015, ' The Average Tree Permission Value for Games with a Permission Tree ', Economic Theory, vol. 58, no. 1, pp. 99-123 . https://doi.org/10.1007/s00199-013-0796-5
Economic Theory, 58(1), 99-123. Springer New York
Economic Theory, 58(1), 99-123. Springer Verlag
Economic Theory, 58(1), 99-123. Springer New York
Economic Theory, 58(1), 99-123. Springer Verlag
This discussion paper resulted in a publication in the 'Economic Theory' , 2015, 58, 99-123. In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of player
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::070946a3f10c877e6a4437d2a002776b
https://hdl.handle.net/1871.1/c2b4b314-92ae-472e-a6df-88f571a8e39e
https://hdl.handle.net/1871.1/c2b4b314-92ae-472e-a6df-88f571a8e39e
Autor:
P.J.J. Herings, A.J.J. Talman
Publikováno v:
Journal of Optimization Theory and Applications, 96(2), 311-335. SPRINGER/PLENUM PUBLISHERS
In all existing intersection theorems, conditions are given under which a certain subset of a collection of sets has a nonempty intersection. In this paper, conditions are formulated under which the intersection is a continuum of points satisfying so