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 0 1 22
A Characterization of the Average Tree Solution for Cycle-Free Graph Games 0 0 0 0 2 2 2 5
A Characterization of the average tree solution for tree games 0 0 0 0 0 0 3 10
A Competitive Partnership Formation Process 0 0 0 0 1 4 6 14
A Competitive Partnership Formation Process 0 0 0 20 2 4 6 65
A Competitive Partnership Formation Process 0 0 0 39 2 2 3 123
A Competitive Partnership Formation Process 0 0 0 55 0 0 1 168
A Discrete Multivariate Mean Value Theorem with Applications 0 0 0 0 1 1 1 3
A Discrete Multivariate Mean Value Theorem with Applications 0 0 0 5 1 2 2 57
A Dynamic Auction for Differentiated Items under Price Rigidities 0 0 0 0 0 3 3 8
A Dynamic Auction for Differentiated Items under Price Rigidities 0 0 0 6 3 3 5 38
A Fixed Point Theorem for Discontinuous Functions 0 0 0 83 1 2 4 441
A Fixed Point Theorem for Discontinuous Functions 0 0 0 0 0 1 1 13
A Fixed Point Theorem for Discontinuous Functions 0 0 0 3 0 0 3 34
A General Existence Thorem of Zero Points 0 0 0 3 1 1 3 30
A General Existence Thorem of Zero Points 0 0 0 0 2 2 2 7
A Globally Convergent Price Adjustment Process for Exchange Economies 0 0 0 0 2 2 2 91
A Model of Partnership Formation 0 0 0 0 1 2 3 7
A Model of Partnership Formation 0 0 0 16 1 1 2 52
A NEW TRIANGULATION OF THE UNIT SIMPLEX FOR COMPUTING ECONOMIC EQUILIBRIA 0 0 0 1 1 1 2 331
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 1 1 1 16
A class of simplicial subdivisions for restart fixed point algorithms 0 0 0 0 1 1 1 8
A constructive proof of Ky Fan's coincidence theorem 0 0 0 5 1 1 1 14
A continuous deformation algorithm on the product space of unit simplices 0 0 0 0 1 1 1 4
A continuous deformation algorithm on the product space of unit simplices 0 0 0 0 0 2 2 10
A continuous deformation algorithm on the product space of unit simplices 0 0 0 0 3 3 4 14
A continuous deformation algorithm on the product space of unit simplices (Revised version) 0 0 0 0 2 3 3 19
A continuous deformation algorithm on the product space of unit simplices (Revised version) 0 0 0 0 1 1 1 2
A convergent price adjustment process 0 0 0 1 0 0 2 15
A discrete multivariate mean value theorem with applications 0 0 0 2 0 2 2 14
A dynamic auction for differentiated items under price rigidity 0 0 0 0 0 1 1 13
A fixed point theorem for discontinuous functions 0 0 0 2 3 3 4 35
A fixed point theorem for discontinuous functions 0 0 0 1 4 5 6 30
A fixed point theorem for discontinuous functions 0 0 1 101 0 0 12 420
A general existence theorem of zero points 0 0 0 10 1 2 4 184
A general existence theorem of zero points 0 0 0 0 1 2 4 9
A general existence theorem of zero points 0 0 0 1 1 4 4 38
A globally convergent price adjustment process for exchange economies 0 0 0 1 1 2 2 4
A globally convergent price adjustment process for exchange economies 0 0 1 2 3 3 4 13
A globally convergent simplicial algorithm for stationary point problems on polytopes 0 0 0 0 0 1 1 1
A globally convergent simplicial algorithm for stationary point problems on polytopes 0 0 0 0 0 1 2 8
A homotopy approach to the computation of economic equilibria on the unit simplex 0 0 0 2 0 1 2 13
A homotopy approach to the computation of economic equilibria on the unit simplex 0 0 0 0 0 0 1 2
A new algorithm for the linear complementarity problem allowing for an arbitrary starting point 0 0 0 0 0 1 2 3
A new algorithm for the linear complementarity problem allowing for an arbitrary starting point 0 0 0 0 0 0 0 14
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point 0 0 0 1 0 0 0 9
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices 0 0 0 2 1 1 1 17
A new strategy adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 0 1 5
A new strategy-adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 1 1 3
A new strategy-adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 1 1 1
A new strategy-adjustment process for computing a Nash equilibrium in a noncooperative more-person game 0 0 0 0 0 0 1 10
A new subdivision for computing fixed points with a homotopy algorithm 0 0 0 0 1 3 5 13
A new triangulation of the unit simplex for computing economic equilibria 0 0 0 0 1 1 2 11
A new triangulation of the unit simplex for computing economic equilibria 0 0 0 1 0 1 3 11
A new triangulation of the unit simplex for computing economic equilibria 0 0 0 0 0 1 1 2
A new variable dimension simplicial algorithm for computing economic equilibria on S**n x R**m+ 0 0 0 0 1 1 1 7
A new variable dimension simplicial algorithm to find equilibria on the product space of unit simplices 0 0 0 2 0 1 2 5
A new variable dimension simplicial algorithm to find equilibria on the product space of unit simplices 0 0 0 1 2 2 2 21
A procedure for finding Nash equilibria in bi-matrix games 0 0 0 0 2 2 2 3
A procedure for finding Nash equilibria in bi-matrix games 0 0 0 0 1 1 5 18
A procedure for finding Nash equilibria in bi-matrix games 0 0 1 2 1 2 3 14
A production-inventory control model with a mixture of back-orders and lost sales 0 0 1 4 0 0 4 10
A restart algorithm for computing fixed points without an extra dimension 0 0 0 2 0 0 1 14
A simple approach to some production-inventory problems 0 0 0 0 0 0 0 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 6
A simplicial algorithm for computing proper Nash equilibria of finite games 0 0 0 5 0 0 1 17
A simplicial algorithm for computing proper Nash equilibria of finite games 0 0 0 1 1 1 4 6
A simplicial algorithm for finding equilibria in economies with linear production technologies 0 0 0 0 1 1 2 11
A simplicial algorithm for finding equilibria in economies with linear production technologies 0 0 0 0 1 2 3 4
A simplicial algorithm for stationary point problems on polytopes 0 0 0 0 1 1 4 6
A simplicial algorithm for stationary point problems on polytopes 0 0 0 0 1 1 2 16
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 1 1 2 17
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 1 1 4 6
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 1 1 5 8
A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron 0 0 0 0 2 2 3 19
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 1 5
A simplicial variable dimension restart algorithm to find economic equilibria on the unit simplex using n(n+1) rays 0 0 0 2 0 1 2 20
A vector labeling method for solving discrete zero point and complementarity problems 0 0 0 0 1 3 4 21
AN ADJUSTMENT PROCESS FOR AN EXCHANGE ECONOMY WITH LINEAR PRODUCTION TECHNOLOGIES 0 0 0 0 2 2 3 256
Adjustment processes for finding economic equilibria 0 0 0 2 1 2 3 19
Adjustment processes for finding economic equilibria 0 0 0 0 3 3 5 8
Adjustment processes for finding equilibria on the simplotope 0 0 0 2 1 2 2 13
Adjustment processes for finding equilibria on the simplotope 0 0 0 0 2 3 3 5
Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point 0 0 0 61 0 1 3 239
Algorithms for the linear complementarity problem which allow an arbitrary starting point 0 0 0 1 0 1 2 14
Algorithms for the linear complementarity problem which allow an arbitrary starting point 0 0 0 0 3 4 4 4
Algorithms for the linear complementarity problem which allow an arbitrary starting point 0 0 0 1 0 3 3 11
An Algorithmic Approach Towards the Tracing Procedure of Harsanyi and Selten 0 0 0 1 0 1 2 349
An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders 0 0 0 35 0 1 2 101
An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders 0 0 0 0 0 1 2 7
An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders 0 0 0 5 5 8 10 46
An Interior-Point Path-Following Method for Computing a Perfect Stationary Point of a Polynomial Mapping on a Polytope 0 0 0 0 0 0 0 2
An Interior-Point Path-Following Method for Computing a Perfect Stationary Point of a Polynomial Mapping on a Polytope 0 0 0 12 0 0 1 56
An SLSPP-algorithm to compute an equilibrium in an economy with linear production technologies 0 0 0 0 5 5 6 47
An SLSPP-algorithm to compute an equilibrium in an economy with linear production technologies 0 0 0 0 5 21 29 32
An adjustment process for an exchange economy with linear production technologies 0 0 0 0 1 1 1 20
An adjustment process for an exchange economy with linear production technologies 0 0 0 0 0 0 0 5
An adjustment process for an exchange economy with linear production technologies 0 0 0 7 0 1 4 70
An adjustment process for an exchange economy with linear production technologies 0 0 0 0 0 0 0 13
An algorithm for the linear complementarity problem with upper and lower bounds 0 0 0 0 1 1 1 5
An algorithm for the linear complementarity problem with upper and lower bounds 0 0 0 3 0 0 0 12
An algorithm for the linear complementarity problem with upper and lower bounds 0 0 0 3 3 3 3 28
An algorithmic approach towards the tracing procedure of Harsanyi and Selten 0 0 0 18 1 1 3 48
An algorithmic approach towards the tracing procedure of Harsanyi and Selten 0 0 0 3 0 1 1 9
An improvement of fixed point algorithms by using a good triangulation 0 0 0 0 3 3 6 13
Average tree solution and subcore for acyclic graph games 0 0 0 1 0 0 0 10
Balanced Simplices on Polytopes 0 0 0 1 2 2 3 5
Balanced Simplices on Polytopes 0 0 0 2 1 2 2 27
Berekende evenwichten 0 0 0 1 0 0 0 6
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games 0 0 0 11 6 8 9 41
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games 0 0 0 0 0 0 1 5
Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games 0 0 0 24 0 1 3 46
Characterization of the Walrasian equilibria of the assignment model 1 1 1 2 3 4 5 25
Characterization of the walrasian equilibria of the assignment model 0 0 0 1 3 3 4 11
Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations 0 0 1 17 2 3 7 167
Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations 0 0 0 0 0 0 2 7
Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations 0 0 0 0 0 1 2 29
Combinatorial integer labeling theorems on finite sets with applications 0 0 0 0 1 1 1 17
Competitive Equilibria in Economies with Multiple Divisible and Indivisible Commodities and No Money 0 0 0 0 1 1 1 3
Competitive Equilibria in Economies with Multiple Divisible and Indivisible Commodities and No Money 0 0 0 4 0 2 3 42
Competitive Equilibria in Economies with Multiple Divisible and Multiple Divisible Commodities 0 0 0 2 1 2 2 27
Competitive Equilibria in Economies with Multiple Divisible and Multiple Divisible Commodities 0 0 0 0 1 1 3 8
Computing Integral Solutions of Complementarity Problems 0 0 0 0 1 1 1 18
Computing Integral Solutions of Complementarity Problems 0 0 0 28 0 1 2 232
Computing Integral Solutions of Complementarity Problems 0 0 0 0 2 2 2 4
Computing economic equilibria by variable dimension algorithms: State of the art 0 0 0 0 0 0 1 2
Computing economic equilibria by variable dimension algorithms: State of the art 0 0 0 0 1 3 3 15
Computing integral solutions of complementarity problems 0 0 0 0 1 1 1 21
Computing normal form perfect equilibria for extensive two-person games 0 0 0 0 1 1 2 36
Computing normal form perfect equilibria for extensive two-person games 0 0 0 1 2 2 2 8
Computing normal form perfect equilibria for extensive two-person games 0 1 1 3 2 6 12 35
Contimuum of zero points of a mapping on a compact, convex set 0 0 0 0 1 3 5 20
Contiuum of Zero Points of a Mapping on a Compact Convex Set 0 0 1 1 0 0 1 4
Contiuum of Zero Points of a Mapping on a Compact Convex Set 0 0 0 0 0 2 3 13
Cooperative Games in Graph Structure 0 1 1 90 1 2 4 609
Cooperative Games in Graph Structure 0 0 0 0 0 0 3 7
Cooperative Games in Graph Structure 0 0 0 7 0 0 4 49
Cooperative games in graph structure 0 0 0 4 0 0 0 12
Cooperative games in permutational structure 0 0 0 1 1 2 3 17
Dynamic Adjustment of Supply Constrained Disequilibria to Walrasian Equilibrium 0 0 0 0 2 4 5 8
Dynamic Adjustment of Supply Constrained Disequilibria to Walrasian Equilibrium 0 0 0 0 0 4 4 28
Dynamic adjustment of supply constrained disequilibria to Walrasian equilibria 0 0 0 0 1 1 1 18
Equilibria with Coordination Failures 0 0 0 1 3 4 4 24
Equilibria with Coordination Failures 0 0 0 0 2 3 3 7
Equilibria with coordination failures 0 0 0 1 1 1 2 29
Equilibrium adjustment of disequilibrium prices 0 0 0 1 1 1 3 22
Equilibrium adjustment of disequilibrium prices 0 0 0 6 1 3 4 226
Equilibrium adjustment of disequilibrium prices 0 0 0 1 0 2 5 18
Equilibrium in the Assignment Market under Budget Constraints 0 0 0 5 0 1 3 41
Equilibrium in the Assignment Market under Budget Constraints 0 0 0 0 3 3 6 13
Equilibrium in the Assignment Market under Budget Constraints 0 0 0 10 0 1 2 30
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible, Indivisible Commodities and Linear Production Technologies 0 0 0 0 1 1 2 5
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible, Indivisible Commodities and Linear Production Technologies 0 0 0 0 1 1 1 19
Existence and approximation of robust stationary points on polytopes 0 0 0 0 0 0 1 13
Existence and approximation of robust stationary points on polytopes 0 0 0 0 0 0 0 1
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 15
Existence of Equilibrium and Price Adjustments in a Finance Economy with Incomplete Markets 0 0 0 3 0 1 1 26
Existence of Equilibrium and Price Adjustments in a Finance Economy with Incomplete Markets 0 0 0 0 2 3 4 4
Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money 0 0 0 0 0 1 1 5
Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money 0 0 0 4 3 3 3 42
Existence of an equilibrium in a competitive economy with indivisibilities and money 0 0 0 2 2 2 3 22
Existence of balanced simplices on polytopes 0 0 0 0 2 3 3 16
Finding a Nash equilibrium in noncooperative N-person games by solving a sequence of linear stationary point problems 0 0 0 3 1 1 2 11
Finding a Nash equilibrium in noncooperative N-person games by solving a sequence of linear stationary point problems 0 0 0 0 1 1 2 2
Finding a Nash-equilibrium in noncooperative N-person games by solving a sequence of linear stationary point problems 0 0 0 2 1 1 1 10
From fixed point to equilibrium 0 0 0 0 2 2 2 13
From fixed point to equilibrium 0 0 0 0 2 3 4 4
GENERAL EQUILIBRIUM PROGRAMMING 0 0 0 1 1 1 2 224
Games With General Coalitional Structure 0 0 0 3 2 3 3 22
Games With General Coalitional Structure 0 0 0 0 1 1 1 3
Games With Limited Communication Structure 0 0 0 0 1 2 2 4
Games With Limited Communication Structure 0 0 0 4 1 1 3 16
General equilibrium programming 0 0 0 0 0 1 1 4
General equilibrium programming 0 0 0 0 2 4 4 7
General equilibrium programming 0 0 0 2 2 2 3 29
General equilibrium programming 0 0 0 0 1 1 3 4
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs 0 0 0 4 2 2 3 49
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs 0 0 0 6 2 2 3 35
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs 0 0 0 0 0 0 0 4
Homotopy interpretation of price adjustment proces 0 0 0 2 1 3 3 16
Homotopy interpretation of price adjustment proces 0 0 0 0 5 5 5 6
Interpretation of the variable dimension fixed point algorithm with an artificial level 0 0 0 0 1 1 1 11
Intersection Theorems on the Simplotope 0 0 0 0 1 1 1 103
Intersection Theorems on the Unit Simplex and the Simplotope 0 0 0 1 1 1 2 251
Intersection theorems on polytopes 0 0 0 0 0 0 1 4
Intersection theorems on polytopes 0 0 0 1 1 1 1 23
Intersection theorems on polytypes 0 0 0 0 1 1 1 16
Intersection theorems on the simplotope 0 0 0 2 0 2 2 7
Intersection theorems on the simplotope 0 0 0 1 0 0 0 13
Intersection theorems on the unit simplex and the simplotope 0 0 0 0 1 1 1 2
Intersection theorems on the unit simplex and the simplotope 0 0 0 0 0 0 0 4
Intersection theorems on the unit simplex and the simplotope 0 0 0 2 0 1 2 20
Intersection theorems with a continuum of intersection points 0 0 0 0 0 0 0 9
Intersection theorems with a continuum of intersection points 0 0 0 1 2 4 4 29
LINEAR STATIONARY POINT PROBLEMS 0 0 0 1 0 2 3 171
LINEAR STATIONARY POINT PROBLEMS ON UNBOUNDED POLYHEDRA 0 0 0 0 1 2 2 142
Lemke-Howson method with arbitrary starting strategy 0 0 0 0 0 0 0 3
Lemke-Howson method with arbitrary starting strategy 0 0 0 4 1 1 4 47
Linear stationary point problems 0 0 0 0 0 0 0 1
Linear stationary point problems 0 0 0 0 0 1 1 18
Linear stationary point problems on unbounded polyhedra 0 0 0 0 0 0 2 32
Linear stationary point problems on unbounded polyhedra 0 0 0 0 0 0 0 1
Linear stationary point problems on unbounded polyhedra 0 0 0 0 2 3 4 15
Linear stationary point problems on unbounded polyhedra 0 0 0 0 3 3 4 6
Measuring the Power of Nodes in Digraphs 0 0 0 2 2 3 5 31
Measuring the Power of Nodes in Digraphs 0 0 0 127 2 4 5 608
Measuring the Power of Nodes in Digraphs 0 0 0 127 1 2 3 497
Measuring the Power of Nodes in Digraphs 0 0 0 0 1 2 3 6
Modelling cooperative games in permutational structure 0 0 0 0 0 0 0 20
Modelling cooperative games in permutational structure 0 0 0 0 0 0 1 3
Modification of Kojima-Nishino-Arima Algorithm and Its Computational Complexity 0 0 0 0 0 0 1 448
Modification of the Kojima-Nishino-Arima algorithm and its computational complexity 0 0 0 4 0 0 0 12
Modification of the Kojima-Nishino-Arima algorithm and its computational complexity 0 0 0 0 0 1 1 6
Note of the path following approach of equilibrium programming 0 0 0 0 1 1 1 9
Note of the path following approach of equilibrium programming 0 0 0 0 1 2 3 5
Note on the path-following approach of equilibrium programming 0 0 0 0 0 0 1 11
On a parameterized system of nonlinear equations with economic applications 0 0 0 3 0 0 1 20
On the Connectedness of Coincidences and Zero Points of Mappings 0 0 0 1 2 2 3 17
On the Connectedness of Coincidences and Zero Points of Mappings 0 0 0 0 0 1 1 4
On the computation of fixed points on the product space of unit simplices and an application to noncooperative N-person games 0 0 0 6 1 2 4 26
On the connectedness of coincidences and zero poins of mappings 0 0 0 1 1 1 2 40
On the existence and computation of an equilibrium in an economy with constant returns to scale production 0 0 0 0 1 1 1 4
On the existence and computation of an equilibrium in an economy with constant returns to scale production 0 0 0 3 2 5 5 24
On the existence and computation of an equilibrium in an economy with constant returns to scale production 0 0 0 0 1 2 3 15
Optimal Provision of Infrastructure Using Public-Private Partnership Contracts 0 0 0 9 0 0 2 32
Optimal Provision of Infrastructure Using Public-Private Partnership Contracts 0 0 0 0 1 1 1 2
Optimal Provision of Infrastructure using Public-Private Partnership Contracts 0 0 0 327 0 1 4 719
Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands 0 0 0 5 0 1 1 129
Overdemand and Underdemand in Economies with Indivisible Goods and Unit Demands 0 0 0 1 0 0 0 6
Overdemand and underdemand in economies with indivisible goods and unit demand 0 0 0 2 2 3 4 37
Perfection and Stability of Stationary Points with Applications in Noncooperative Games 0 0 0 3 0 1 1 27
Perfection and Stability of Stationary Points with Applications in Noncooperative Games 0 0 0 0 0 0 1 4
Perfection and Stability of Stationary Points with Applications to Noncooperative Games 0 0 1 48 2 2 3 362
Perfection and stability of stationary points with applications to noncooperative games 0 0 0 8 2 3 6 87
Price regidities and rationing 0 0 0 7 0 0 0 94
Price rigidities and rationing 0 0 0 1 0 2 3 21
Price rigidities and rationing 0 0 0 0 2 3 5 12
Price-Quantity Adjustment in a Keynesian Economy 0 0 0 2 0 5 7 28
Price-Quantity Adjustment in a Keynesian Economy 0 0 0 0 5 5 5 10
Quantity Constrained Equilibria 0 0 0 1 1 1 2 27
Quantity Constrained Equilibria 0 0 0 39 1 3 3 300
Quantity Constrained Equilibria 0 0 0 0 0 0 1 4
Quantity Constrained General Equilibrium 0 0 0 2 0 2 2 13
Quantity Constrained General Equilibrium 0 0 0 7 3 11 11 89
Quantity constrained equilibria 0 0 0 34 0 0 2 343
Random Matching Models and Money: The Global Structure and Approximation of Stationary Equilibria 0 0 0 1 0 1 1 20
Random Matching Models and Money: The Global Structure and Approximation of Stationary Equilibria 0 0 0 0 0 1 2 4
Random Matching Models and Money: The Global Structure and Approximation of the Set of Stationary Equilibria 0 0 0 19 0 1 1 114
Refinement of solutions to the linear complimentarity problem 0 0 0 0 1 1 2 12
Refinement of solutions to the linear complimentarity problem 0 0 0 0 0 1 1 2
SIMPLICAL ALGORITHM TO FIND ZERO POINTS OF A FUNCTION WITH SPECIAL STRUCTURE ON SIMPLOTOPE 0 0 0 0 0 0 0 519
Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders 0 0 0 26 2 2 4 114
Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders 0 0 0 3 2 2 3 38
Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders 0 0 0 0 0 1 2 5
Shortest paths for simplicial algorithms 0 0 0 0 0 0 1 18
Shortest paths for simplicial algorithms 0 0 0 0 1 4 5 7
Signaling devices for the supply of semi-public goods 0 0 0 0 1 1 2 3
Signaling devices for the supply of semi-public goods 0 0 0 5 0 0 2 45
Simplical algorithms for finding stationary points, a unifying description 0 0 0 1 1 3 4 21
Simplical algorithms for finding stationary points, a unifying description 0 0 0 0 0 0 1 2
Simplicial algorithm for computing a core element in a balanced game 0 0 0 2 1 2 2 16
Simplicial algorithm to find zero points of a function with special structure on a simplotope 0 0 0 0 0 0 1 11
Simplicial algorithm to find zero points of a function with special structure on a simplotope 0 0 0 0 0 0 1 3
Simplicial algorithm to find zero points of a function with special structure on a simplotope 0 0 0 0 0 1 1 7
Simplicial algorithms for solving the nonlinear complementarity problem on the simplotope 0 0 0 1 0 0 0 3
Simplicial algorithms for solving the nonlinear complementarity problem on the simplotope 0 0 0 0 0 2 5 17
Simplicial approximation of solutions to the nonlinear complementarity problem 0 0 0 3 0 0 1 16
Simplicial approximation of solutions to the nonlinear complementarity problem 0 0 0 0 1 1 1 2
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds 0 0 0 1 1 1 1 11
Socially Structured Games and their Applications 0 0 0 2 0 2 2 33
Socially Structured Games and their Applications 0 0 0 0 0 0 1 7
Socially structured games 0 0 0 2 1 1 1 29
Socially structured games and their applications 0 0 0 0 0 0 0 4
Solution Concepts for Cooperative Games with Circular Communication Structure 0 0 0 0 1 1 1 3
Solution Concepts for Cooperative Games with Circular Communication Structure 0 0 0 1 1 1 1 19
Solution Concepts for Games with General Coalitional Structure (Replaced by CentER DP 2011-119) 0 0 0 3 0 1 1 21
Solution Concepts for Games with General Coalitional Structure (Replaced by CentER DP 2011-119) 0 0 0 0 0 1 1 4
Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025) 0 0 0 0 1 1 1 7
Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025) 0 0 0 3 1 1 3 26
Solutions For Games With General Coalitional Structure And Choice Sets 0 0 0 0 1 3 3 7
Solutions For Games With General Coalitional Structure And Choice Sets 0 0 0 4 0 1 1 34
Solving Discrete Systems of Nonlinear Equations 0 0 0 54 0 2 2 338
Solving Discrete Systems of Nonlinear Equations 0 0 0 0 1 1 1 5
Solving Discrete Systems of Nonlinear Equations 0 0 0 3 2 4 6 42
Solving Discrete Zero Point Problems 0 0 0 22 0 2 2 149
Solving Discrete Zero Point Problems with Vector Labeling 0 0 0 0 0 0 1 3
Solving Discrete Zero Point Problems with Vector Labeling 0 0 0 0 0 0 1 18
Solving Discrete Zero Point Problems with Vector Labeling 0 0 0 35 0 1 1 347
Solving discrete systems of nonlinear equations 0 0 0 0 2 2 2 22
Solving discrete zero point problems 0 0 0 1 0 1 3 30
Solving discrete zero point problems 0 0 0 0 1 3 3 4
Solving the nonlinear complementarity problem 0 0 0 0 0 0 0 11
Solving the nonlinear complementarity problem 0 0 0 1 0 1 1 9
Solving the nonlinear complementarity problem 0 0 0 0 0 1 1 3
Solving the nonlinear complementarity problem with lower and upper bounds 0 0 0 1 0 0 1 7
Solving the nonlinear complementarity problem with lower and upper bounds 0 0 0 0 0 1 3 5
Solving the nonlinear complementarity problem with lower and upper bounds 0 0 0 3 0 0 1 14
Supermodular NTU-games 0 0 0 26 1 1 2 59
Supermodular NTU-games 0 0 0 0 1 2 3 6
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 0 1 173
The (2**(n+1)-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria 0 0 0 1 1 1 1 19
The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria 0 0 0 0 0 2 2 21
The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria 0 0 0 1 2 3 4 10
The (2n+m+1-2)-ray algorithm: a new variable dimension simplicial algorithm for computing economic equilibria on Sn×Rm+ 0 0 0 0 2 3 3 9
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 0 0 13
The 2-ray algorithm for solving equilibrium problems on the unit simplex 0 0 0 1 0 0 1 13
The 2-ray algorithm for solving equilibrium problems on the unit simplex 0 0 0 0 0 2 3 9
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 1 1 1 3
The Average Covering Tree Value for Directed Graph Games 0 0 0 11 1 1 3 39
The Average Tree Permission Value for Games with a Permission Tree 0 0 0 0 2 3 3 10
The Average Tree Permission Value for Games with a Permission Tree 0 0 0 1 4 4 6 44
The Average Tree Permission Value for Games with a Permission Tree 0 0 0 5 4 5 7 46
The Average Tree Solution for Cooperative Games with Communication Structure 0 0 1 63 2 2 3 287
The Average Tree Solution for Cooperative Games with Communication Structure 0 0 0 0 0 1 2 7
The Average Tree Solution for Cooperative Games with Communication Structure 0 0 0 1 0 0 1 20
The Average Tree permission value for games with a permission tree 0 0 0 22 1 2 3 35
The Average Tree value for Hypergraph Games 0 0 0 15 1 1 2 23
The Average Tree value for Hypergraph Games 0 0 0 0 1 2 3 14
The Communication Tree Value for TU-games with Graph Communication 0 0 0 0 0 0 1 4
The Communication Tree Value for TU-games with Graph Communication 0 0 0 4 2 4 5 25
The Component Fairness Solution for Cycle-Free Graph Games 0 0 0 0 2 2 2 19
The Component Fairness Solution for Cycle-Free Graph Games 0 0 0 0 3 4 4 10
The Component Fairness Solution for Cycle-free Graph Games 0 0 0 30 2 5 5 364
The Computation of a Coincidence of Two Mappings 0 0 0 0 2 2 2 14
The Computation of a Coincidence of Two Mappings 0 0 0 0 1 1 1 2
The D1-triangulation in simplicial variable dimension algorithms for computing solutions of nonlinear equations 0 0 0 1 0 1 1 14
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 1 1
The D1-triangulation in simplicial variable dimension algorithms for computing solutions of nonlinear equations 0 0 0 0 0 0 0 11
The Shapley Value for Directed Graph Games 0 0 0 0 1 1 2 5
The Shapley Value for Directed Graph Games 0 0 0 44 1 1 2 58
The Socially Stable Core in Structured Transferable Utility Games 0 0 0 2 3 3 5 30
The Socially Stable Core in Structured Transferable Utility Games 0 0 0 0 6 7 8 12
The Socially Stable Core in Structured Transferable Utility Games 0 0 0 42 1 1 2 256
The Two-Step Average Tree Value for Graph and Hypergraph Games 0 0 0 4 1 3 4 18
The Two-Step Average Tree Value for Graph and Hypergraph Games 0 0 0 4 0 0 0 16
The average covering tree value for directed graph games 0 0 0 4 0 1 2 9
The average tree permission value for games with a permission tree 0 0 0 44 1 3 3 95
The average tree solution for cooperative games with communication structure 0 0 0 36 0 0 1 150
The average tree solution for cooperative games with communication structure 0 0 0 7 1 1 2 37
The average tree solution for cycle-free graph games 0 0 0 12 1 1 2 48
The average tree solution for cycle-free graph games 0 0 0 1 3 3 4 26
The component fairness solution for cycle-free graph games 0 0 0 196 4 5 7 964
The computation of a continuum of constrained equilibria 0 0 0 3 2 5 7 28
The computation of a continuum of constrained equilibria 0 0 0 1 1 2 3 10
The computation of a continuum of constrained equilibria 0 0 0 0 1 1 1 15
The number of ways to construct a connected graph: A graph-based generalization of the binomial coefficients 0 0 1 4 0 0 2 9
The socially stable core in structured transferable utility games 0 0 0 61 2 4 5 933
The socially stable core in structured transferable utility games 0 0 0 1 1 1 1 10
The two-step average tree value for graph and hypergraph games 0 0 0 1 1 3 6 9
Tracing equilibria in extensive games by complementary pivoting 0 0 1 3 0 0 3 12
Tracing equilibria in extensive games by complementary pivoting 0 0 0 0 0 0 0 3
Tree, Web and Average Web Value for Cycle-Free Directed Graph Games 0 0 0 0 0 0 1 6
Tree, Web and Average Web Value for Cycle-Free Directed Graph Games 0 0 0 1 1 3 3 23
Tree-Type Values for Cycle-Free Directed Graph Games 0 0 0 3 0 1 2 21
Tree-Type Values for Cycle-Free Directed Graph Games 0 0 0 0 0 1 3 3
Two solution concepts for TU games with cycle-free directed cooperation structures 0 0 0 0 0 1 1 7
VARIABLE DIMENSION SIMPLICIAL ALGORITHM FOR BALANCED GAMES 0 0 0 0 1 3 3 193
Van vast punt tot evenwicht 0 0 0 1 1 2 2 13
Variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using general labelling 0 0 0 1 1 1 1 19
Variable dimension algorithms for unproper labellings 0 0 0 0 0 0 1 1
Variable dimension algorithms for unproper labellings 0 0 0 0 0 0 2 23
Variable dimension fixed point algorithms and triangulations 0 0 0 6 1 1 1 11
Variable dimension simplicial algorithm for balanced games 0 0 0 3 0 0 0 11
Variable dimension simplicial algorithm for balanced games 0 0 0 0 1 2 3 6
Variational Inequality Problems With a Continuum of Solutions: Existence and Computation 0 0 0 0 4 5 6 21
Variational Inequality Problems With a Continuum of Solutions: Existence and Computation 0 0 0 1 1 3 3 7
Variational inequality problems with a continuum of solutions: Existence and computation 0 0 0 2 1 3 5 22
Volume Flexibility and Capacity Investment: A Real Options Approach 0 0 0 0 2 2 2 8
Volume Flexibility and Capacity Investment: A Real Options Approach 0 0 0 27 0 0 2 90
Total Working Papers 1 3 13 2,477 343 598 923 18,988
1 registered items for which data could not be found

Journal Article File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Production-Inventory Control Model with a Mixture of Back-Orders and Lost-Sales 0 0 0 0 1 1 1 25
A characterization of the average tree solution for tree games 0 0 0 12 1 3 5 57
A competitive partnership formation process 0 0 1 30 0 0 2 93
A convergent price adjustment process 0 0 0 25 2 2 4 129
A discrete multivariate mean value theorem with applications 1 1 2 39 1 2 6 310
A dynamic auction for differentiated items under price rigidities 0 0 0 13 0 0 2 69
A globally convergent price adjustment process for exchange economies 0 0 1 10 2 2 4 49
A model of partnership formation 0 0 0 32 1 2 5 110
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 1 2 2
An Algorithmic Approach toward the Tracing Procedure for Bi-matrix Games 0 0 1 18 0 0 7 72
An efficient multi-item dynamic auction with budget constrained bidders 0 0 0 7 2 4 6 53
Characterization of the Walrasian equilibria of the assignment model 0 1 3 43 1 3 8 151
Combinatorial Integer Labeling Theorems on Finite Sets with Applications 0 0 0 0 3 4 6 10
Competitive equilibria in economies with multiple indivisible and multiple divisible commodities 0 0 0 7 2 3 3 87
Computing Normal Form Perfect Equilibria for Extensive Two-Person Games 0 0 0 36 2 2 4 267
Cooperative games in permutational structure 0 0 0 109 0 1 2 878
Equilibria with coordination failures 0 0 0 22 0 1 5 124
Equilibrium adjustment of disequilibrium prices 0 0 0 15 1 2 5 150
Equivalence and axiomatization of solutions for cooperative games with circular communication structure 0 0 0 3 0 1 3 34
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible and Indivisible Commodities and Linear Production Technologies 0 0 0 13 2 2 2 99
Existence of an equilibrium in a competitive economy with indivisibilities and money 0 0 0 26 1 2 2 173
Existence of equilibrium and price adjustments in a finance economy with incomplete markets 0 0 0 21 1 1 1 84
Extended Antipodal Theorems 0 0 0 0 1 1 1 10
General Existence Theorem of Zero Points 0 0 0 1 5 8 9 19
Intersection Theorems with a Continuum of Intersection Points 0 0 0 0 1 1 2 14
Matching models with a conservation law: The existence and global structure of the set of stationary equilibria 0 0 0 11 0 0 2 50
On a Parameterized System of Nonlinear Equations with Economic Applications 0 0 0 0 1 1 2 8
Sets in excess demand in simple ascending auctions with unit-demand bidders 0 0 1 16 4 5 9 56
Socially Structured Games 0 0 0 16 0 0 1 210
Solution concepts for games with general coalitional structure 0 0 0 3 2 3 5 29
Solving discrete systems of nonlinear equations 0 0 0 7 0 0 1 53
The Average Tree permission value for games with a permission tree 0 0 0 3 1 2 2 36
The average covering tree value for directed graph games 0 0 0 1 0 0 2 13
The average tree solution for cooperative games with communication structure 0 0 1 53 1 2 4 215
The average tree solution for cycle-free graph games 0 0 0 77 2 2 4 281
The average tree value for hypergraph games 0 0 0 2 0 1 2 6
The positional power of nodes in digraphs 0 0 0 25 1 2 2 174
The socially stable core in structured transferable utility games 0 0 0 13 0 1 2 90
The two-step average tree value for graph and hypergraph games 0 0 1 1 1 2 4 6
Tree, web and average web values for cycle-free directed graph games 0 0 0 0 0 0 1 21
Variable dimension fixed point algorithms and triangulations 0 0 0 0 0 0 1 2
Volume flexibility and capacity investment: a real options approach 0 0 2 5 2 4 6 52
Total Journal Articles 1 2 13 715 45 74 147 4,371

logo

LogEc Home

Top Working Papers
Top Journal Articles
Top Books
Top Chapters
Top Software Items

Top Authors

Top Working Paper series and Journals

About LogEc

Authors with papers registered in the RePEc Author Service.

Register yourself as an author or register more papers in the RePEc Author Service.

Authors with no registered papers

RePEc
LogEc provides access and usage statistics for services based on the RePEc data set.

Örebro UniversityLogEc is hosted by the Örebro University School of Business.

Questions or comments? Please see our explanation of how the statistics are collected or e-mail

Statistics updated 2025-12-06