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