| Working Paper |
File Downloads |
Abstract Views |
| Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |
| A Banzhaf share function for cooperative games in coalition structure |
0 |
0 |
0 |
1 |
0 |
10 |
12 |
26 |
| A Banzhaf share function for cooperative games in coalition structure |
0 |
0 |
0 |
0 |
1 |
3 |
4 |
7 |
| A Class of Consistent Share Functions For Games in Coalition Structure |
0 |
0 |
0 |
1 |
1 |
3 |
5 |
27 |
| A Class of Consistent Share Functions For Games in Coalition Structure |
0 |
0 |
0 |
0 |
0 |
2 |
5 |
5 |
| A Class of Consistent Share Functions for Games in Coalition Structure |
0 |
0 |
0 |
35 |
1 |
4 |
7 |
180 |
| A Fixed Point Theorem for Discontinuous Functions |
0 |
0 |
0 |
3 |
0 |
2 |
4 |
36 |
| 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 Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games |
0 |
0 |
0 |
26 |
1 |
2 |
2 |
64 |
| A class of simplicial subdivisions for restart fixed point algorithms |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
8 |
| A convergent price adjustment process |
0 |
0 |
0 |
1 |
1 |
2 |
3 |
17 |
| A fixed point theorem for discontinuous functions |
0 |
0 |
0 |
1 |
0 |
0 |
6 |
30 |
| 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 |
2 |
0 |
2 |
6 |
37 |
| A new subdivision for computing fixed points with a homotopy algorithm |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
13 |
| A price adjustment process for an economy with a block-diagonal pattern |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
| A price adjustment process for an economy with a block-diagonal pattern |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
13 |
| A restart algorithm for computing fixed points without an extra dimension |
0 |
0 |
0 |
2 |
1 |
4 |
5 |
18 |
| 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 |
0 |
4 |
6 |
| A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron |
0 |
0 |
0 |
0 |
0 |
10 |
13 |
29 |
| 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 |
0 |
1 |
3 |
8 |
11 |
| Adjustment processes for finding economic equilibria |
0 |
0 |
0 |
2 |
3 |
6 |
9 |
25 |
| 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 |
| An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure |
0 |
0 |
0 |
44 |
1 |
8 |
10 |
207 |
| An Ascending Multi-Item Auction with Financially Constrained Bidders |
0 |
0 |
1 |
46 |
0 |
11 |
16 |
170 |
| An Ascending Multi-Item Auction with Financially Constrained Bidders |
0 |
0 |
0 |
62 |
0 |
7 |
12 |
209 |
| An Axiomatic Analysis of Joint Liability Problems with Rooted -Tree Structure |
0 |
0 |
0 |
14 |
1 |
2 |
3 |
54 |
| An Efficient and Fair Solution for Communication Graph Games |
0 |
0 |
0 |
29 |
1 |
5 |
7 |
85 |
| An Owen-Type Value for Games with Two-Level Communication Structures |
0 |
0 |
0 |
14 |
1 |
2 |
6 |
72 |
| An adjustment process for an exchange economy with linear production technologies |
0 |
0 |
0 |
0 |
1 |
6 |
6 |
11 |
| 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 |
0 |
4 |
4 |
17 |
| An adjustment process for an exchange economy with linear production technologies |
0 |
0 |
0 |
7 |
1 |
4 |
7 |
74 |
| 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 |
3 |
0 |
1 |
4 |
29 |
| An algorithm for the linear complementarity problem with upper and lower bounds |
0 |
0 |
0 |
0 |
0 |
3 |
4 |
8 |
| An efficient format for a problem based introductory economics course |
0 |
0 |
0 |
13 |
3 |
5 |
5 |
163 |
| An improvement of fixed point algorithms by using a good triangulation |
0 |
0 |
0 |
0 |
0 |
1 |
5 |
14 |
| Associated Consistency Characterization of Two Linear Values for TU Games by Matrix Approach |
0 |
0 |
0 |
26 |
1 |
9 |
10 |
67 |
| Asymmetric Nash Solutions in the River Sharing Problem |
0 |
0 |
1 |
43 |
0 |
5 |
10 |
89 |
| Axiomatizations of Two Types of Shapley Values for Games on Union Closed Systems |
0 |
0 |
0 |
20 |
0 |
2 |
3 |
90 |
| Balanced Simplices on Polytopes |
0 |
0 |
0 |
1 |
0 |
3 |
6 |
8 |
| Balanced Simplices on Polytopes |
0 |
0 |
0 |
2 |
0 |
4 |
6 |
31 |
| Bertrand Price Competition in a Social Environment |
0 |
0 |
0 |
160 |
1 |
4 |
5 |
863 |
| Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games |
0 |
0 |
0 |
0 |
0 |
8 |
9 |
13 |
| 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 |
| 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 |
2 |
4 |
31 |
| 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 theorems on finite sets with applications |
0 |
0 |
0 |
0 |
1 |
2 |
3 |
19 |
| Comparable Characterizations of Four Solutions for Permission Tree Games |
0 |
0 |
0 |
12 |
3 |
10 |
10 |
46 |
| Computation of an industrial equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
| Computation of an industrial equilibrium |
0 |
0 |
0 |
0 |
2 |
4 |
5 |
18 |
| Computation of an industrial equilibrium |
0 |
0 |
0 |
6 |
1 |
4 |
5 |
120 |
| Computation of the Nucleolus for a Class of Disjunctive Games with a Permission Structure |
0 |
0 |
0 |
24 |
2 |
4 |
6 |
122 |
| 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 |
| Cooperation in a Multi-Dimensional Local Interaction Model |
0 |
0 |
0 |
137 |
0 |
6 |
9 |
756 |
| Cooperative Games in Graph Structure |
0 |
0 |
1 |
90 |
0 |
2 |
5 |
611 |
| Cooperative Games in Graph Structure |
0 |
0 |
0 |
0 |
0 |
7 |
9 |
14 |
| Cooperative Games in Graph Structure |
0 |
0 |
0 |
7 |
0 |
4 |
6 |
53 |
| 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 |
| Core Concepts for Share Vectors |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
6 |
| Core Concepts for Share Vectors |
0 |
0 |
0 |
0 |
0 |
3 |
3 |
14 |
| Demand Adjustment in Coalitional Games |
0 |
0 |
0 |
9 |
2 |
6 |
8 |
78 |
| Distributing Dividends in Games with Ordered Players |
0 |
0 |
1 |
44 |
1 |
5 |
9 |
139 |
| 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 |
1 |
0 |
1 |
4 |
23 |
| Equilibrium adjustment of disequilibrium prices |
0 |
0 |
0 |
6 |
0 |
2 |
6 |
228 |
| Equilibrium adjustment of disequilibrium prices |
0 |
0 |
0 |
1 |
0 |
0 |
3 |
18 |
| Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
0 |
1 |
3 |
9 |
16 |
| 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 |
5 |
0 |
2 |
4 |
43 |
| Evolutionary Game Theory and the Modelling of Economic Behavior |
0 |
0 |
0 |
916 |
2 |
10 |
11 |
2,405 |
| 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 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 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 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 |
0 |
1 |
7 |
8 |
12 |
| 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 |
| Fair Agreements for Sharing International Rivers with Multiple Springs and Externalities |
0 |
0 |
0 |
55 |
1 |
8 |
14 |
146 |
| From Hierarchies to Levels: New Solutions for Games |
0 |
0 |
0 |
17 |
0 |
4 |
7 |
45 |
| From Hierarchies to Levels: New Solutions for Games with Hierarchical Structure |
0 |
0 |
0 |
19 |
3 |
13 |
16 |
118 |
| 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 |
| Games on Union Closed Systems |
0 |
0 |
1 |
15 |
2 |
9 |
11 |
65 |
| General Equilibrium in Economies with Infinite Dimensional Commodity Spaces: A Truncation Approach |
0 |
0 |
0 |
63 |
3 |
10 |
10 |
390 |
| General equilibrium in a closed international trade model |
0 |
0 |
0 |
3 |
2 |
5 |
8 |
31 |
| Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs |
0 |
0 |
0 |
6 |
0 |
5 |
7 |
40 |
| 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 |
4 |
0 |
0 |
2 |
49 |
| Harsanyi Power Solutions for Graph-restricted Games |
0 |
0 |
0 |
101 |
1 |
8 |
10 |
476 |
| Harsanyi Solutions in Line-graph Games |
0 |
0 |
0 |
106 |
2 |
8 |
10 |
987 |
| Independence Axioms for Water Allocation |
0 |
0 |
0 |
22 |
5 |
9 |
11 |
97 |
| International Environmental Agreements for River Sharing Problems |
0 |
0 |
0 |
16 |
1 |
6 |
10 |
47 |
| International bond markets and the introduction of the euro |
0 |
0 |
0 |
86 |
0 |
5 |
6 |
444 |
| 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 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 |
| Learning in a Local Interaction Hawk-Dove Game |
0 |
0 |
0 |
81 |
0 |
5 |
7 |
561 |
| 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 |
127 |
1 |
13 |
17 |
621 |
| Measuring the Power of Nodes in Digraphs |
0 |
0 |
0 |
2 |
0 |
1 |
6 |
32 |
| Measuring the Power of Nodes in Digraphs |
0 |
0 |
0 |
0 |
0 |
5 |
8 |
11 |
| 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 |
| Monotone improvement of the social welfare in an industrial network |
0 |
0 |
0 |
1 |
1 |
4 |
5 |
19 |
| Network Formation under Heterogeneous Costs: The Multiple Group Model |
0 |
0 |
0 |
49 |
2 |
4 |
7 |
208 |
| Note of the path following approach of equilibrium programming |
0 |
0 |
0 |
0 |
1 |
3 |
4 |
12 |
| Note of the path following approach of equilibrium programming |
0 |
0 |
0 |
0 |
0 |
2 |
4 |
7 |
| Note on the path-following approach of equilibrium programming |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
11 |
| Note on ‘Competition in Two-sided Markets’ |
0 |
0 |
0 |
120 |
4 |
16 |
21 |
147 |
| On Harsanyi Payoff Vectors and the Weber Set |
0 |
0 |
2 |
100 |
1 |
9 |
12 |
349 |
| On the Extreme Points of Two Polytopes associated with a Digraph and Applications to Cooperative Games |
0 |
0 |
0 |
26 |
2 |
7 |
8 |
170 |
| 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 exclusion from the use of a public good and pareto optimality |
0 |
0 |
0 |
2 |
1 |
5 |
7 |
26 |
| 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 |
| PRICE RIGIDITIES AND RATIONING |
0 |
0 |
0 |
0 |
1 |
6 |
8 |
383 |
| 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 |
| Potentials and Reduced Games for Share Functions |
0 |
0 |
0 |
0 |
0 |
3 |
5 |
8 |
| Potentials and Reduced Games for Share Functions |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
17 |
| Price adjustment in a two-country model |
0 |
0 |
0 |
0 |
0 |
2 |
2 |
16 |
| Price adjustment in a two-country model |
0 |
0 |
0 |
0 |
0 |
6 |
6 |
35 |
| Price adjustment in a two-country model |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
3 |
| 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 |
39 |
1 |
5 |
8 |
305 |
| Quantity Constrained Equilibria |
0 |
0 |
0 |
1 |
0 |
3 |
5 |
30 |
| Quantity Constrained Equilibria |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
| Quantity constrained equilibria |
0 |
0 |
0 |
34 |
0 |
3 |
5 |
346 |
| Share Functions for Cooperative Games with Levels Structure of Cooperation |
0 |
0 |
0 |
15 |
3 |
11 |
17 |
103 |
| 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 |
1 |
0 |
3 |
6 |
24 |
| Simplical algorithms for finding stationary points, a unifying description |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
| 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 |
| Simplicial approximation of unemployment equilibria |
0 |
0 |
0 |
1 |
2 |
6 |
8 |
13 |
| Socially Structured Games and their Applications |
0 |
0 |
0 |
2 |
0 |
5 |
7 |
38 |
| Socially Structured Games and their Applications |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
9 |
| 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 of general equilibrium models with nonconvex technologies |
0 |
0 |
0 |
5 |
0 |
4 |
5 |
38 |
| 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 |
35 |
0 |
2 |
3 |
349 |
| Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
0 |
0 |
3 |
4 |
21 |
| Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
5 |
| 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 |
| 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 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 |
1 |
0 |
2 |
8 |
46 |
| 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 |
0 |
1 |
2 |
6 |
7 |
26 |
| 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 |
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 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 |
0 |
5 |
11 |
13 |
30 |
| The Component Fairness Solution for Cycle-free Graph Games |
0 |
0 |
0 |
30 |
0 |
3 |
8 |
367 |
| The Harsanyi Set for Cooperative TU-Games |
0 |
0 |
0 |
74 |
2 |
3 |
5 |
218 |
| The Normalized Banzhaf Value and the Banzhaf Share Function |
0 |
0 |
0 |
5 |
1 |
1 |
3 |
24 |
| The Normalized Banzhaf Value and the Banzhaf Share Function |
0 |
0 |
0 |
0 |
0 |
2 |
3 |
5 |
| The Restricted Core for Totally Positive Games with Ordered Players |
0 |
0 |
0 |
55 |
0 |
4 |
5 |
156 |
| The Reverse Talmud Rule for Bankruptcy Problems |
0 |
0 |
0 |
102 |
0 |
3 |
9 |
494 |
| 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 |
2 |
0 |
6 |
11 |
36 |
| The Socially Stable Core in Structured Transferable Utility Games |
0 |
0 |
0 |
42 |
2 |
5 |
7 |
261 |
| The Tort Law and the Nucleolus for Generalized Joint Liability Problems |
0 |
0 |
0 |
20 |
0 |
2 |
6 |
36 |
| The Transition from a Drèze Equilibrium to a Walrasian Equilibrium |
0 |
0 |
2 |
96 |
0 |
3 |
7 |
597 |
| 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 |
0 |
0 |
1 |
0 |
6 |
10 |
32 |
| The average tree solution for cycle-free graph games |
0 |
1 |
1 |
13 |
0 |
2 |
3 |
50 |
| The component fairness solution for cycle-free graph games |
0 |
0 |
0 |
196 |
0 |
6 |
13 |
970 |
| The feasibility of a fixed exchange rate regime for new EU-members: evidence from real exchange rates |
0 |
0 |
0 |
74 |
2 |
5 |
7 |
429 |
| 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 online target date assignment problem |
0 |
0 |
0 |
56 |
1 |
5 |
9 |
773 |
| 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 weak sequential core for two-period economies |
0 |
0 |
0 |
302 |
1 |
10 |
13 |
1,095 |
| Transboundary Externalities and Property Rights: An International River Pollution Model |
0 |
0 |
0 |
67 |
5 |
14 |
19 |
318 |
| Two Values for Transferable Utility Games with Coalition and Graph Structure |
0 |
0 |
0 |
6 |
1 |
4 |
6 |
45 |
| 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 |
1 |
3 |
24 |
| Variable dimension algorithms for unproper labellings |
0 |
0 |
0 |
0 |
0 |
3 |
3 |
4 |
| Total Working Papers |
0 |
3 |
14 |
5,290 |
209 |
1,104 |
1,632 |
27,743 |