Access Statistics for Dolf Talman

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Characterization of the Average Tree Solution for Cycle-Free Graph Games 0 0 0 1 0 1 5 20
A Characterization of the Average Tree Solution for Cycle-Free Graph Games 0 0 0 0 0 2 3 3
A Characterization of the average tree solution for tree games 0 0 0 33 0 1 2 93
A Characterization of the average tree solution for tree games 0 0 0 0 0 1 2 2
A Competitive Partnership Formation Process 0 0 1 39 0 1 4 117
A Competitive Partnership Formation Process 0 0 0 20 0 2 6 55
A Competitive Partnership Formation Process 0 1 1 55 0 1 4 162
A Competitive Partnership Formation Process 0 0 0 0 0 2 4 5
A Discrete Multivariate Mean Value Theorem with Applications 0 0 1 5 1 3 8 44
A Discrete Multivariate Mean Value Theorem with Applications 0 0 0 0 0 0 2 2
A Dynamic Auction for Differentiated Items under Price Rigidities 0 0 0 6 0 0 1 33
A Dynamic Auction for Differentiated Items under Price Rigidities 0 0 0 0 0 2 4 5
A Fixed Point Theorem for Discontinuous Functions 0 0 2 3 0 0 5 30
A Fixed Point Theorem for Discontinuous Functions 0 0 0 0 0 1 3 4
A Fixed Point Theorem for Discontinuous Functions 0 0 0 79 0 0 2 427
A General Existence Thorem of Zero Points 0 0 0 0 0 1 5 5
A General Existence Thorem of Zero Points 0 0 0 3 0 3 4 25
A Globally Convergent Price Adjustment Process for Exchange Economies 0 0 0 0 0 1 3 88
A Model of Partnership Formation 0 0 0 0 0 0 1 2
A Model of Partnership Formation 0 0 0 16 0 2 2 46
A NEW TRIANGULATION OF THE UNIT SIMPLEX FOR COMPUTING ECONOMIC EQUILIBRIA 0 0 0 1 0 1 2 327
A better triangulation for Wright's 2nd ray algorithm 0 0 0 0 0 0 0 5
A characterization of the average tree solution for cycle-free graph games 0 0 0 1 0 0 0 13
A class of simplicial subdivisions for restart fixed point algorithms 0 0 0 0 0 0 0 6
A constructive proof of Ky Fan's coincidence theorem 0 0 0 3 0 1 2 9
A continuous deformation algorithm on the product space of unit simplices 0 0 0 0 0 0 0 7
A continuous deformation algorithm on the product space of unit simplices 0 0 0 0 0 0 3 3
A continuous deformation algorithm on the product space of unit simplices 0 0 0 0 0 0 1 10
A continuous deformation algorithm on the product space of unit simplices (Revised version) 0 0 0 0 0 0 0 0
A continuous deformation algorithm on the product space of unit simplices (Revised version) 0 0 0 0 0 2 2 15
A convergent price adjustment process 0 0 0 1 0 0 0 12
A discrete multivariate mean value theorem with applications 0 0 0 1 0 0 1 10
A dynamic auction for differentiated items under price rigidity 0 0 0 0 0 0 1 10
A fixed point theorem for discontinuous functions 0 0 0 1 0 0 1 23
A fixed point theorem for discontinuous functions 0 0 0 0 0 0 2 26
A fixed point theorem for discontinuous functions 0 0 1 98 1 2 5 402
A general existence theorem of zero points 0 0 0 0 0 1 5 5
A general existence theorem of zero points 0 0 0 1 0 0 1 33
A general existence theorem of zero points 0 0 0 10 5 10 19 170
A globally convergent price adjustment process for exchange economies 0 0 0 1 0 1 1 6
A globally convergent price adjustment process for exchange economies 0 0 0 0 0 0 0 0
A globally convergent simplicial algorithm for stationary point problems on polytopes 0 0 0 0 0 1 2 6
A globally convergent simplicial algorithm for stationary point problems on polytopes 0 0 0 0 0 0 0 0
A homotopy approach to the computation of economic equilibria on the unit simplex 0 0 0 2 0 0 1 11
A homotopy approach to the computation of economic equilibria on the unit simplex 0 0 0 0 0 0 0 0
A new algorithm for the linear complementarity problem allowing for an arbitrary starting point 0 0 0 0 0 0 0 0
A new algorithm for the linear complementarity problem allowing for an arbitrary starting point 0 0 0 0 0 1 4 13
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point 0 0 0 1 0 2 2 9
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices 0 0 0 2 0 0 0 15
A new strategy adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 1 1 4
A new strategy-adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 2 3 9
A new strategy-adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 0 0 0
A new strategy-adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 2 2 2
A new subdivision for computing fixed points with a homotopy algorithm 0 0 0 0 0 0 1 8
A new triangulation of the unit simplex for computing economic equilibria 0 0 0 0 0 1 1 9
A new triangulation of the unit simplex for computing economic equilibria 0 0 0 1 0 0 0 7
A new triangulation of the unit simplex for computing economic equilibria 0 0 0 0 0 1 1 1
A new variable dimension simplicial algorithm for computing economic equilibria on S**n x R**m+ 0 0 0 0 0 3 3 6
A new variable dimension simplicial algorithm to find equilibria on the product space of unit simplices 0 0 0 0 0 0 0 0
A new variable dimension simplicial algorithm to find equilibria on the product space of unit simplices 0 0 0 1 0 1 2 18
A procedure for finding Nash equilibria in bi-matrix games 0 0 0 0 0 1 2 10
A procedure for finding Nash equilibria in bi-matrix games 0 0 0 0 0 0 0 0
A procedure for finding Nash equilibria in bi-matrix games 0 0 0 0 0 0 0 12
A production-inventory control model with a mixture of back-orders and lost sales 0 0 0 3 0 0 0 5
A restart algorithm for computing fixed points without an extra dimension 0 0 0 2 0 2 3 11
A simple approach to some production-inventory problems 0 0 0 0 0 1 1 2
A simple proof of the optimality of the best N-policy in the M/G/1 queueing control problem with removable server 0 0 0 0 0 1 1 5
A simplicial algorithm for computing proper Nash equilibria of finite games 0 0 0 5 0 1 2 16
A simplicial algorithm for computing proper Nash equilibria of finite games 0 0 0 0 0 1 1 1
A simplicial algorithm for finding equilibria in economies with linear production technologies 0 0 0 0 0 2 3 9
A simplicial algorithm for finding equilibria in economies with linear production technologies 0 0 0 0 0 1 1 1
A simplicial algorithm for stationary point problems on polytopes 0 0 0 0 0 1 1 1
A simplicial algorithm for stationary point problems on polytopes 0 0 0 0 0 0 0 12
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 0 1 1 1
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 0 0 0 0
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 0 2 4 14
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 0 0 0 12
A simplicial variable dimension restart algorithm to find economic equilibria on the unit simplex using n(n+1) rays 0 0 0 0 0 0 3 3
A simplicial variable dimension restart algorithm to find economic equilibria on the unit simplex using n(n+1) rays 0 0 0 2 0 0 1 17
A vector labeling method for solving discrete zero point and complementarity problems 0 0 0 0 0 0 0 17
AN ADJUSTMENT PROCESS FOR AN EXCHANGE ECONOMY WITH LINEAR PRODUCTION TECHNOLOGIES 0 0 0 0 0 1 2 253
Adjustment processes for finding economic equilibria 0 0 0 0 0 1 1 1
Adjustment processes for finding economic equilibria 0 0 0 2 0 1 2 14
Adjustment processes for finding equilibria on the simplotope 0 0 0 0 0 1 1 1
Adjustment processes for finding equilibria on the simplotope 0 0 0 1 0 1 1 9
Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point 0 0 0 61 0 1 2 236
Algorithms for the linear complementarity problem which allow an arbitrary starting point 0 0 0 0 0 1 2 7
Algorithms for the linear complementarity problem which allow an arbitrary starting point 0 0 0 0 0 0 0 9
Algorithms for the linear complementarity problem which allow an arbitrary starting point 0 0 0 0 0 0 0 0
An Algorithmic Approach Towards the Tracing Procedure of Harsanyi and Selten 0 0 0 1 0 0 0 342
An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders 0 0 1 34 0 2 9 93
An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders 0 0 0 5 0 1 4 35
An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders 0 0 0 0 0 3 5 5
An Interior-Point Path-Following Method for Computing a Perfect Stationary Point of a Polynomial Mapping on a Polytope 0 0 0 12 0 3 5 54
An Interior-Point Path-Following Method for Computing a Perfect Stationary Point of a Polynomial Mapping on a Polytope 0 0 0 0 1 1 1 1
An SLSPP-algorithm to compute an equilibrium in an economy with linear production technologies 0 0 0 0 0 0 1 41
An SLSPP-algorithm to compute an equilibrium in an economy with linear production technologies 0 0 0 0 0 1 2 3
An adjustment process for an exchange economy with linear production technologies 0 0 0 0 0 0 1 17
An adjustment process for an exchange economy with linear production technologies 0 0 0 0 0 0 1 12
An adjustment process for an exchange economy with linear production technologies 0 0 0 7 0 1 4 66
An adjustment process for an exchange economy with linear production technologies 0 0 0 0 0 2 4 4
An algorithm for the linear complementarity problem with upper and lower bounds 0 0 0 2 0 0 0 10
An algorithm for the linear complementarity problem with upper and lower bounds 0 0 0 0 0 1 3 3
An algorithm for the linear complementarity problem with upper and lower bounds 0 0 0 1 0 0 2 22
An algorithmic approach towards the tracing procedure of Harsanyi and Selten 0 0 0 0 0 0 0 0
An algorithmic approach towards the tracing procedure of Harsanyi and Selten 0 0 0 10 0 1 2 27
An improvement of fixed point algorithms by using a good triangulation 0 0 0 0 0 0 0 6
Average tree solution and subcore for acyclic graph games 0 0 0 1 0 0 0 9
Balanced Simplices on Polytopes 0 0 0 0 0 1 1 1
Balanced Simplices on Polytopes 0 0 0 2 0 0 1 24
Berekende evenwichten 0 0 0 1 0 0 0 4
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games 0 0 0 0 0 1 4 4
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games 0 0 0 24 2 4 6 39
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games 0 0 0 11 0 1 3 29
Characterization of the Walrasian equilibria of the assignment model 0 0 0 1 0 1 4 16
Characterization of the walrasian equilibria of the assignment model 0 0 0 0 0 1 2 2
Characterization of the walrasian equilibria of the assignment model 0 0 0 23 0 2 3 130
Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations 0 0 0 16 0 1 2 159
Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations 0 0 0 0 0 2 3 27
Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations 0 0 0 0 0 2 4 4
Combinatorial integer labeling theorems on finite sets with applications 0 0 0 0 0 2 2 16
Competitive Equilibria in Economies with Multiple Divisible and Indivisible Commodities and No Money 0 0 0 0 0 0 0 1
Competitive Equilibria in Economies with Multiple Divisible and Indivisible Commodities and No Money 0 0 0 4 0 0 0 38
Competitive Equilibria in Economies with Multiple Divisible and Multiple Divisible Commodities 0 0 0 0 0 1 2 3
Competitive Equilibria in Economies with Multiple Divisible and Multiple Divisible Commodities 0 0 0 2 0 2 2 25
Computing Integral Solutions of Complementarity Problems 0 0 0 27 0 1 2 226
Computing Integral Solutions of Complementarity Problems 0 0 0 0 0 1 2 16
Computing Integral Solutions of Complementarity Problems 0 0 0 0 0 1 2 2
Computing economic equilibria by variable dimension algorithms: State of the art 0 0 0 0 0 1 1 1
Computing economic equilibria by variable dimension algorithms: State of the art 0 0 0 0 0 1 2 12
Computing integral solutions of complementarity problems 0 0 0 0 0 0 2 20
Computing normal form perfect equilibria for extensive two-person games 0 0 0 1 0 1 3 17
Computing normal form perfect equilibria for extensive two-person games 0 0 0 1 0 2 3 5
Computing normal form perfect equilibria for extensive two-person games 0 0 0 0 0 1 5 30
Contimuum of zero points of a mapping on a compact, convex set 0 0 0 0 0 1 4 11
Contiuum of Zero Points of a Mapping on a Compact Convex Set 0 0 0 0 0 1 1 1
Contiuum of Zero Points of a Mapping on a Compact Convex Set 0 0 0 0 0 1 1 10
Cooperative Games in Graph Structure 0 0 0 7 0 1 2 43
Cooperative Games in Graph Structure 0 0 0 0 0 1 2 3
Cooperative Games in Graph Structure 0 0 0 87 1 2 12 587
Cooperative games in graph structure 0 0 0 0 0 1 2 2
Cooperative games in permutational structure 0 0 0 1 0 0 0 13
Dynamic Adjustment of Supply Constrained Disequilibria to Walrasian Equilibrium 0 0 0 0 0 0 1 2
Dynamic Adjustment of Supply Constrained Disequilibria to Walrasian Equilibrium 0 0 0 0 0 1 1 23
Dynamic adjustment of supply constrained disequilibria to Walrasian equilibria 0 0 0 0 0 0 1 15
Equilibria with Coordination Failures 0 0 0 0 0 0 0 0
Equilibria with Coordination Failures 0 0 0 1 0 2 4 19
Equilibria with coordination failures 0 0 0 1 0 2 2 27
Equilibrium adjustment of disequilibrium prices 0 0 0 5 0 1 23 219
Equilibrium adjustment of disequilibrium prices 0 0 0 1 0 2 4 18
Equilibrium adjustment of disequilibrium prices 0 0 0 0 0 2 3 5
Equilibrium in the Assignment Market under Budget Constraints 0 0 0 0 0 0 3 3
Equilibrium in the Assignment Market under Budget Constraints 0 0 0 9 0 2 5 26
Equilibrium in the Assignment Market under Budget Constraints 0 0 0 5 0 3 12 34
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible, Indivisible Commodities and Linear Production Technologies 0 0 0 0 0 0 1 17
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible, Indivisible Commodities and Linear Production Technologies 0 0 0 0 0 2 2 3
Existence and approximation of robust stationary points on polytopes 0 0 0 0 0 0 0 0
Existence and approximation of robust stationary points on polytopes 0 0 0 0 0 0 0 12
Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production 0 0 0 0 0 1 1 12
Existence of Equilibrium and Price Adjustments in a Finance Economy with Incomplete Markets 0 0 0 0 0 0 0 0
Existence of Equilibrium and Price Adjustments in a Finance Economy with Incomplete Markets 0 0 0 3 0 0 1 25
Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money 0 0 0 4 0 0 0 37
Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money 0 0 0 0 1 3 4 4
Existence of an equilibrium in a competitive economy with indivisibilities and money 0 0 0 2 0 2 2 18
Existence of balanced simplices on polytopes 0 0 0 0 0 3 5 13
Finding a Nash equilibrium in noncooperative N-person games by solving a sequence of linear stationary point problems 0 0 0 3 0 0 0 8
Finding a Nash equilibrium in noncooperative N-person games by solving a sequence of linear stationary point problems 0 0 0 0 0 0 0 0
Finding a Nash-equilibrium in noncooperative N-person games by solving a sequence of linear stationary point problems 0 0 0 2 0 0 0 9
From fixed point to equilibrium 0 0 0 0 0 1 1 10
From fixed point to equilibrium 0 0 0 0 0 0 0 0
GENERAL EQUILIBRIUM PROGRAMMING 0 0 0 1 0 0 1 221
Games With General Coalitional Structure 0 0 0 3 0 1 1 19
Games With General Coalitional Structure 0 0 0 0 0 0 1 1
Games With Limited Communication Structure 0 0 0 3 0 0 1 11
Games With Limited Communication Structure 0 0 0 0 0 1 2 2
General equilibrium programming 0 0 0 0 0 0 0 0
General equilibrium programming 0 0 0 0 0 0 1 2
General equilibrium programming 0 0 0 0 0 1 1 1
General equilibrium programming 0 0 0 2 0 1 1 25
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs 0 0 0 4 0 1 1 38
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs 0 0 1 5 0 1 12 30
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs 0 0 0 0 0 2 2 2
Homotopy interpretation of price adjustment proces 0 0 0 2 0 0 1 13
Homotopy interpretation of price adjustment proces 0 0 0 0 0 0 0 0
Interpretation of the variable dimension fixed point algorithm with an artificial level 0 0 0 0 0 1 1 8
Intersection Theorems on the Simplotope 0 0 0 0 0 2 2 100
Intersection Theorems on the Unit Simplex and the Simplotope 0 0 0 1 0 1 2 247
Intersection theorems on polytopes 0 0 0 1 0 1 2 21
Intersection theorems on polytopes 0 0 0 0 0 0 3 3
Intersection theorems on polytypes 0 0 0 0 0 0 1 11
Intersection theorems on the simplotope 0 0 0 0 0 3 4 12
Intersection theorems on the simplotope 0 0 0 0 0 1 2 2
Intersection theorems on the unit simplex and the simplotope 0 0 0 2 0 1 1 18
Intersection theorems on the unit simplex and the simplotope 0 0 0 0 0 0 1 1
Intersection theorems on the unit simplex and the simplotope 0 0 0 0 0 0 0 3
Intersection theorems with a continuum of intersection points 0 0 0 0 0 4 6 7
Intersection theorems with a continuum of intersection points 0 0 0 1 0 2 3 20
LINEAR STATIONARY POINT PROBLEMS 0 0 0 1 0 1 1 167
LINEAR STATIONARY POINT PROBLEMS ON UNBOUNDED POLYHEDRA 0 0 0 0 0 0 0 137
Lemke-Howson method with arbitrary starting strategy 0 0 0 0 1 1 1 1
Lemke-Howson method with arbitrary starting strategy 0 0 0 3 0 1 4 41
Linear stationary point problems 0 0 0 0 0 0 1 1
Linear stationary point problems 0 0 0 0 0 0 2 17
Linear stationary point problems on unbounded polyhedra 0 0 0 0 0 0 0 9
Linear stationary point problems on unbounded polyhedra 0 0 0 0 0 2 2 2
Linear stationary point problems on unbounded polyhedra 0 0 0 0 0 0 0 0
Linear stationary point problems on unbounded polyhedra 0 0 0 0 0 1 3 10
Measuring the Power of Nodes in Digraphs 0 0 0 126 0 0 1 601
Measuring the Power of Nodes in Digraphs 0 1 1 125 0 2 5 483
Measuring the Power of Nodes in Digraphs 0 0 0 2 0 0 1 24
Measuring the Power of Nodes in Digraphs 0 0 0 0 0 1 2 2
Modelling cooperative games in permutational structure 0 0 0 0 0 2 2 20
Modelling cooperative games in permutational structure 0 0 0 0 0 1 1 1
Modification of Kojima-Nishino-Arima Algorithm and Its Computational Complexity 0 0 0 0 0 0 0 447
Modification of the Kojima-Nishino-Arima algorithm and its computational complexity 0 0 0 2 0 0 0 9
Modification of the Kojima-Nishino-Arima algorithm and its computational complexity 0 0 0 0 0 1 2 3
Note of the path following approach of equilibrium programming 0 0 0 0 0 1 1 7
Note of the path following approach of equilibrium programming 0 0 0 0 0 2 2 2
Note on the path-following approach of equilibrium programming 0 0 0 0 0 0 0 10
On a parameterized system of nonlinear equations with economic applications 0 0 0 3 0 0 1 12
On the Connectedness of Coincidences and Zero Points of Mappings 0 0 0 0 0 0 2 2
On the Connectedness of Coincidences and Zero Points of Mappings 0 0 0 1 0 1 2 13
On the computation of fixed points on the product space of unit simplices and an application to noncooperative N-person games 0 0 0 4 0 1 2 16
On the connectedness of coincidences and zero poins of mappings 0 0 0 1 0 2 2 32
On the existence and computation of an equilibrium in an economy with constant returns to scale production 0 0 0 0 0 2 2 2
On the existence and computation of an equilibrium in an economy with constant returns to scale production 0 0 0 0 0 1 2 11
On the existence and computation of an equilibrium in an economy with constant returns to scale production 0 0 0 3 0 0 0 18
Optimal Provision of Infrastructure Using Public-Private Partnership Contracts 0 0 0 9 0 3 3 29
Optimal Provision of Infrastructure Using Public-Private Partnership Contracts 0 0 0 0 0 1 1 1
Optimal Provision of Infrastructure using Public-Private Partnership Contracts 0 0 1 327 0 3 4 715
Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands 0 0 0 5 0 0 9 124
Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands 0 0 0 0 1 2 3 3
Overdemand and underdemand in economies with indivisible goods and unit demand 0 0 0 0 0 0 6 6
Overdemand and underdemand in economies with indivisible goods and unit demand 0 0 0 16 0 2 6 148
Perfection and Stability of Stationary Points with Applications in Noncooperative Games 0 0 0 0 0 1 1 1
Perfection and Stability of Stationary Points with Applications in Noncooperative Games 0 0 0 3 0 2 3 25
Perfection and Stability of Stationary Points with Applications to Noncooperative Games 1 1 1 46 2 5 10 356
Perfection and stability of stationary points with applications to noncooperative games 0 0 1 7 0 3 8 76
Price regidities and rationing 0 0 0 7 0 1 4 92
Price rigidities and rationing 0 0 0 0 0 2 3 4
Price rigidities and rationing 0 0 0 1 0 2 2 15
Price-Quantity Adjustment in a Keynesian Economy 0 0 0 0 0 1 4 4
Price-Quantity Adjustment in a Keynesian Economy 0 0 0 2 0 1 1 21
Quantity Constrained Equilibria 0 0 0 37 0 2 2 288
Quantity Constrained Equilibria 0 0 0 1 0 0 2 21
Quantity Constrained Equilibria 0 0 0 0 0 1 2 3
Quantity Constrained General Equilibrium 0 0 1 1 0 1 3 6
Quantity Constrained General Equilibrium 0 0 0 7 0 1 4 76
Quantity constrained equilibria 0 0 0 31 0 1 2 307
Random Matching Models and Money: The Global Structure and Approximation of Stationary Equilibria 0 0 0 1 0 3 3 17
Random Matching Models and Money: The Global Structure and Approximation of Stationary Equilibria 0 0 0 0 0 0 1 1
Random Matching Models and Money: The Global Structure and Approximation of the Set of Stationary Equilibria 0 0 0 18 0 0 2 111
Refinement of solutions to the linear complimentarity problem 0 0 0 0 0 0 0 0
Refinement of solutions to the linear complimentarity problem 0 0 0 0 0 1 1 10
SIMPLICAL ALGORITHM TO FIND ZERO POINTS OF A FUNCTION WITH SPECIAL STRUCTURE ON SIMPLOTOPE 0 0 0 0 0 0 2 519
Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders 0 0 2 25 0 2 9 102
Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders 0 0 0 0 0 0 2 3
Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders 0 0 0 3 0 0 1 34
Shortest paths for simplicial algorithms 0 0 0 0 0 1 3 17
Shortest paths for simplicial algorithms 0 0 0 0 0 0 1 1
Signaling devices for the supply of semi-public goods 0 0 0 5 0 1 3 41
Signaling devices for the supply of semi-public goods 0 0 0 0 0 0 1 1
Simplical algorithms for finding stationary points, a unifying description 0 0 0 0 0 0 0 0
Simplical algorithms for finding stationary points, a unifying description 0 0 0 1 0 1 3 17
Simplicial algorithm for computing a core element in a balanced game 0 0 0 1 0 0 0 9
Simplicial algorithm to find zero points of a function with special structure on a simplotope 0 0 0 0 0 1 2 2
Simplicial algorithm to find zero points of a function with special structure on a simplotope 0 0 0 0 0 1 1 6
Simplicial algorithm to find zero points of a function with special structure on a simplotope 0 0 0 0 0 1 1 10
Simplicial algorithms for solving the nonlinear complementarity problem on the simplotope 0 0 0 0 0 1 2 11
Simplicial algorithms for solving the nonlinear complementarity problem on the simplotope 0 0 0 0 0 1 1 1
Simplicial approximation of solutions to the nonlinear complementarity problem 0 0 0 0 0 0 0 0
Simplicial approximation of solutions to the nonlinear complementarity problem 0 0 0 3 0 0 1 15
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds 0 0 0 1 0 0 0 8
Socially Structured Games and their Applications 0 0 0 0 0 2 3 3
Socially Structured Games and their Applications 0 0 0 2 0 0 0 30
Socially structured games 0 0 0 1 1 2 5 22
Socially structured games and their applications 0 0 0 0 0 1 2 2
Solution Concepts for Cooperative Games with Circular Communication Structure 0 0 0 0 0 1 1 1
Solution Concepts for Cooperative Games with Circular Communication Structure 0 0 0 1 0 0 0 18
Solution Concepts for Games with General Coalitional Structure (Replaced by CentER DP 2011-119) 0 0 0 0 0 2 2 3
Solution Concepts for Games with General Coalitional Structure (Replaced by CentER DP 2011-119) 0 0 0 3 0 0 2 20
Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025) 0 0 0 0 0 1 4 5
Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025) 0 0 0 2 0 0 1 21
Solutions For Games With General Coalitional Structure And Choice Sets 0 0 0 0 0 2 4 4
Solutions For Games With General Coalitional Structure And Choice Sets 0 0 0 4 2 3 3 33
Solving Discrete Systems of Nonlinear Equations 0 0 0 0 0 1 2 2
Solving Discrete Systems of Nonlinear Equations 0 0 0 3 0 1 2 34
Solving Discrete Systems of Nonlinear Equations 0 1 1 53 0 2 7 334
Solving Discrete Zero Point Problems 0 0 0 22 0 0 1 146
Solving Discrete Zero Point Problems with Vector Labeling 0 0 0 0 0 0 1 16
Solving Discrete Zero Point Problems with Vector Labeling 0 0 0 0 0 1 1 1
Solving Discrete Zero Point Problems with Vector Labeling 0 0 0 32 0 2 4 342
Solving discrete systems of nonlinear equations 0 0 0 0 0 3 4 18
Solving discrete zero point problems 0 0 0 1 0 1 2 26
Solving discrete zero point problems 0 0 0 0 0 0 0 0
Solving the Linear Stationary Point Problem on Polytopes 0 0 0 0 0 1 1 116
Solving the nonlinear complementarity problem 0 0 0 0 0 0 1 1
Solving the nonlinear complementarity problem 0 0 0 0 0 0 3 10
Solving the nonlinear complementarity problem 0 0 0 1 0 1 1 7
Solving the nonlinear complementarity problem with lower and upper bounds 0 0 0 3 0 0 1 13
Solving the nonlinear complementarity problem with lower and upper bounds 0 0 0 0 0 0 2 2
Solving the nonlinear complementarity problem with lower and upper bounds 0 0 0 1 0 0 1 6
Supermodular NTU-games 0 0 0 26 0 2 3 55
Supermodular NTU-games 0 0 0 0 0 2 3 3
THE D1 -TRIANGULATION IN SIMPLICAL VARIABLE DIMENSION ALGORITHMS FOR COMPUTING SOLUTIONS ON NONLINEAR EQUATIONS 0 0 0 0 0 0 0 265
THE D1-TRIANGULATION IN SIMPLICIAL VARIABLE DIMENSION ALGORITHMS ON THE UNIT SIMPLEX FOR COMPUTING FIXED POINTS 0 0 0 0 0 1 2 172
The (2**(n+1)-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria 0 0 0 1 0 2 4 14
The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria 0 0 0 0 0 2 2 2
The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria 0 0 0 0 0 1 2 18
The (2n+m+1-2)-ray algorithm: a new variable dimension simplicial algorithm for computing economic equilibria on Sn×Rm+ 0 0 0 0 0 2 2 3
The (2n+m+1-2)-ray algorithm: a new variable dimension simplicial algorithm for computing economic equilibria on Sn×Rm+ 0 0 0 0 0 1 3 12
The 2-ray algorithm for solving equilibrium problems on the unit simplex 0 0 0 0 0 0 0 6
The 2-ray algorithm for solving equilibrium problems on the unit simplex 0 0 0 1 0 1 3 11
The 2-ray algorithm for solving equilibrium problems on the unit simplex 0 0 0 0 0 0 0 0
The Average Covering Tree Value for Directed Graph Games 0 0 0 0 0 0 2 2
The Average Covering Tree Value for Directed Graph Games 0 0 0 11 0 1 2 35
The Average Tree Permission Value for Games with a Permission Tree 0 0 0 0 1 2 4 5
The Average Tree Permission Value for Games with a Permission Tree 0 0 0 4 0 1 2 36
The Average Tree Permission Value for Games with a Permission Tree 0 0 0 1 0 3 4 38
The Average Tree Solution for Cooperative Games with Communication Structure 0 0 0 1 0 1 2 18
The Average Tree Solution for Cooperative Games with Communication Structure 0 0 0 60 0 2 4 277
The Average Tree Solution for Cooperative Games with Communication Structure 0 0 0 0 0 2 4 5
The Average Tree permission value for games with a permission tree 0 0 0 22 0 2 5 32
The Average Tree value for Hypergraph Games 0 0 0 0 0 2 10 11
The Average Tree value for Hypergraph Games 0 0 2 15 0 3 12 18
The Communication Tree Value for TU-games with Graph Communication 0 0 0 4 0 2 4 20
The Communication Tree Value for TU-games with Graph Communication 0 0 0 0 0 0 1 1
The Component Fairness Solution for Cycle-Free Graph Games 0 0 0 0 0 1 2 4
The Component Fairness Solution for Cycle-Free Graph Games 0 0 0 0 0 1 2 17
The Component Fairness Solution for Cycle-free Graph Games 0 0 1 30 0 1 4 352
The Computation of a Coincidence of Two Mappings 0 0 0 0 0 0 0 12
The Computation of a Coincidence of Two Mappings 0 0 0 0 0 0 0 0
The D1-triangulation in simplicial variable dimension algorithms for computing solutions of nonlinear equations 0 0 0 0 0 0 1 10
The D1-triangulation in simplicial variable dimension algorithms for computing solutions of nonlinear equations 0 0 0 0 0 0 0 0
The D1-triangulation in simplicial variable dimension algorithms for computing solutions of nonlinear equations 0 0 0 0 0 0 0 0
The D1-triangulation in simplicial variable dimension algorithms for computing solutions of nonlinear equations 0 0 0 1 0 0 2 12
The Shapley Value for Directed Graph Games 0 0 1 41 0 1 4 50
The Shapley Value for Directed Graph Games 0 0 0 0 0 1 2 2
The Socially Stable Core in Structured Transferable Utility Games 0 0 0 2 0 1 1 23
The Socially Stable Core in Structured Transferable Utility Games 0 0 0 0 0 1 2 3
The Socially Stable Core in Structured Transferable Utility Games 0 0 0 40 0 0 2 251
The Two-Step Average Tree Value for Graph and Hypergraph Games 0 0 4 4 0 2 11 13
The Two-Step Average Tree Value for Graph and Hypergraph Games 0 0 3 3 0 1 10 10
The average covering tree value for directed graph games 0 0 1 4 0 0 5 6
The average tree permission value for games with a permission tree 0 0 1 44 0 1 5 92
The average tree solution for cooperative games with communication structure 0 0 0 36 0 0 4 149
The average tree solution for cooperative games with communication structure 0 0 0 7 0 1 2 34
The average tree solution for cycle-free graph games 0 0 0 1 1 1 2 22
The average tree solution for cycle-free graph games 0 0 0 11 0 0 2 45
The component fairness solution for cycle-free graph games 0 0 0 195 0 3 4 956
The computation of a continuum of constrained equilibria 1 1 1 2 1 2 3 19
The computation of a continuum of constrained equilibria 0 0 1 1 0 2 7 7
The computation of a continuum of constrained equilibria 0 0 0 0 0 2 2 14
The online target date assignment problem 0 0 0 56 0 4 4 760
The socially stable core in structured transferable utility games 0 0 0 60 0 0 3 923
The socially stable core in structured transferable utility games 0 0 0 1 0 0 0 8
Tracing equilibria in extensive games by complementary pivoting 0 0 0 0 0 0 1 1
Tracing equilibria in extensive games by complementary pivoting 0 0 0 1 0 0 0 7
Tree, Web and Average Web Value for Cycle-Free Directed Graph Games 0 0 0 0 0 3 4 4
Tree, Web and Average Web Value for Cycle-Free Directed Graph Games 0 0 0 1 0 1 2 18
Tree-Type Values for Cycle-Free Directed Graph Games 0 0 0 0 0 0 0 0
Tree-Type Values for Cycle-Free Directed Graph Games 0 0 0 3 0 1 3 18
Two solution concepts for TU games with cycle-free directed cooperation structures 0 0 0 0 0 1 1 4
VARIABLE DIMENSION SIMPLICIAL ALGORITHM FOR BALANCED GAMES 0 0 0 0 0 0 0 190
Van vast punt tot evenwicht 0 0 0 1 0 0 1 11
Variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using general labelling 0 0 0 1 0 0 0 17
Variable dimension algorithms for unproper labellings 0 0 0 0 0 0 0 0
Variable dimension algorithms for unproper labellings 0 0 0 0 0 1 1 21
Variable dimension fixed point algorithms and triangulations 0 0 0 6 0 0 1 9
Variable dimension simplicial algorithm for balanced games 0 0 0 3 0 0 1 11
Variable dimension simplicial algorithm for balanced games 0 0 0 0 0 1 2 2
Variational Inequality Problems With a Continuum of Solutions: Existence and Computation 0 0 0 0 0 0 0 11
Variational Inequality Problems With a Continuum of Solutions: Existence and Computation 0 0 0 0 0 2 2 2
Variational inequality problems with a continuum of solutions: Existence and computation 0 0 0 2 0 3 4 17
Volume Flexibility and Capacity Investment: A Real Options Approach 0 0 0 0 0 0 2 3
Volume Flexibility and Capacity Investment: A Real Options Approach 0 0 0 26 0 0 5 84
Total Working Papers 2 5 31 2,490 22 356 856 18,581


Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Continuous Deformation Algorithm on the Product Space of Unit Simplices 0 0 0 0 0 0 0 1
A Production-Inventory Control Model with a Mixture of Back-Orders and Lost-Sales 0 0 0 0 0 1 1 24
A Simplicial Algorithm for Stationary Point Problems on Polytopes 0 0 0 0 0 2 2 4
A characterization of the average tree solution for tree games 0 0 0 12 1 1 2 52
A competitive partnership formation process 0 1 2 25 0 2 4 83
A convergent price adjustment process 0 0 0 24 0 3 5 122
A discrete multivariate mean value theorem with applications 0 0 1 37 0 2 5 302
A dynamic auction for differentiated items under price rigidities 0 0 0 11 0 2 3 64
A globally convergent price adjustment process for exchange economies 0 0 0 9 0 0 0 44
A model of partnership formation 1 1 2 29 2 4 5 98
A simple proof of the optimality of the best N‐policy in the M/G/l queueing control problem with removable server 0 0 0 0 0 0 0 0
An Adjustment Process for an Economy with Linear Production Technologies 0 0 0 0 0 2 2 6
An Algorithmic Approach toward the Tracing Procedure for Bi-matrix Games 0 0 1 16 0 1 3 61
An efficient multi-item dynamic auction with budget constrained bidders 0 0 0 5 1 3 6 42
Characterization of the Walrasian equilibria of the assignment model 0 0 0 37 0 2 2 131
Combinatorial Integer Labeling Theorems on Finite Sets with Applications 0 0 0 0 0 1 2 3
Competitive equilibria in economies with multiple indivisible and multiple divisible commodities 0 0 0 7 0 4 10 76
Computing Normal Form Perfect Equilibria for Extensive Two-Person Games 0 0 0 36 1 3 5 250
Cooperative games in permutational structure 0 0 0 109 0 1 1 876
Equilibria with coordination failures 0 0 0 22 0 2 6 119
Equilibrium adjustment of disequilibrium prices 0 0 0 15 0 1 2 141
Equivalence and axiomatization of solutions for cooperative games with circular communication structure 0 0 1 3 0 1 3 25
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible and Indivisible Commodities and Linear Production Technologies 0 0 2 13 0 1 4 94
Existence of an equilibrium in a competitive economy with indivisibilities and money 0 0 0 26 0 0 1 165
Existence of equilibrium and price adjustments in a finance economy with incomplete markets 0 0 0 21 0 0 1 82
Extended Antipodal Theorems 0 0 0 0 0 0 1 8
General Existence Theorem of Zero Points 0 0 0 1 0 1 5 7
Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level 0 0 0 0 0 0 1 1
Intersection Theorems with a Continuum of Intersection Points 0 0 0 0 2 4 5 7
Linear Stationary Point Problems on Unbounded Polyhedra 0 0 0 0 0 2 2 3
Matching models with a conservation law: The existence and global structure of the set of stationary equilibria 0 0 0 11 0 0 2 48
On a Parameterized System of Nonlinear Equations with Economic Applications 0 0 0 0 0 0 0 1
On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games 0 0 0 0 0 0 3 7
Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope 0 0 0 0 0 1 4 14
Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling 1 2 5 8 1 3 6 15
Socially Structured Games 0 0 0 16 3 4 10 199
Solution concepts for games with general coalitional structure 0 0 0 3 1 1 1 23
Solving discrete systems of nonlinear equations 1 1 1 6 1 3 5 45
The Average Tree permission value for games with a permission tree 0 0 0 3 0 0 1 30
The Computation of a Continuum of Constrained Equilibria 0 0 0 0 0 2 3 8
The average covering tree value for directed graph games 0 0 1 1 1 3 6 8
The average tree solution for cooperative games with communication structure 0 0 0 52 0 2 5 209
The average tree solution for cycle-free graph games 0 0 0 77 0 2 3 276
The positional power of nodes in digraphs 0 0 0 24 0 1 2 167
The socially stable core in structured transferable utility games 0 0 0 13 0 3 5 84
Tree, web and average web values for cycle-free directed graph games 0 0 0 0 0 1 5 20
Variable dimension fixed point algorithms and triangulations 0 0 0 0 0 0 0 1
Volume flexibility and capacity investment: a real options approach 0 0 2 3 1 3 21 43
Total Journal Articles 3 5 18 675 15 75 171 4,089


Statistics updated 2021-11-05