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 |
0 |
0 |
0 |
1 |
1 |

A Banzhaf share function for cooperative games in coalition structure |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
14 |

A Class of Consistent Share Functions For Games in Coalition Structure |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

A Class of Consistent Share Functions For Games in Coalition Structure |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
22 |

A Class of Consistent Share Functions for Games in Coalition Structure |
0 |
0 |
0 |
35 |
0 |
0 |
1 |
173 |

A Fixed Point Theorem for Discontinuous Functions |
0 |
1 |
2 |
83 |
0 |
2 |
4 |
436 |

A Fixed Point Theorem for Discontinuous Functions |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
12 |

A Fixed Point Theorem for Discontinuous Functions |
0 |
0 |
0 |
3 |
0 |
0 |
1 |
31 |

A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games |
0 |
0 |
0 |
26 |
0 |
0 |
0 |
62 |

A class of simplicial subdivisions for restart fixed point algorithms |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
7 |

A convergent price adjustment process |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
13 |

A fixed point theorem for discontinuous functions |
0 |
0 |
0 |
2 |
0 |
0 |
2 |
31 |

A fixed point theorem for discontinuous functions |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
24 |

A fixed point theorem for discontinuous functions |
0 |
0 |
1 |
100 |
0 |
0 |
2 |
408 |

A new subdivision for computing fixed points with a homotopy algorithm |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
8 |

A price adjustment process for an economy with a block-diagonal pattern |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

A price adjustment process for an economy with a block-diagonal pattern |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
11 |

A restart algorithm for computing fixed points without an extra dimension |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
12 |

A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
14 |

A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
16 |

A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
2 |

A simplicial algorithm for the nonlinear stationary point problem on an unbounded polyhedron |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

A vector labeling method for solving discrete zero point and complementarity problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |

AN ADJUSTMENT PROCESS FOR AN EXCHANGE ECONOMY WITH LINEAR PRODUCTION TECHNOLOGIES |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
253 |

Adjustment processes for finding economic equilibria |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
16 |

Adjustment processes for finding economic equilibria |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Adjustment processes for finding equilibria on the simplotope |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
2 |

Adjustment processes for finding equilibria on the simplotope |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
11 |

An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure |
0 |
0 |
0 |
44 |
0 |
0 |
0 |
197 |

An Ascending Multi-Item Auction with Financially Constrained Bidders |
0 |
0 |
0 |
62 |
0 |
0 |
0 |
196 |

An Ascending Multi-Item Auction with Financially Constrained Bidders |
0 |
0 |
0 |
45 |
0 |
0 |
0 |
153 |

An Axiomatic Analysis of Joint Liability Problems with Rooted -Tree Structure |
0 |
0 |
0 |
14 |
0 |
3 |
4 |
51 |

An Efficient and Fair Solution for Communication Graph Games |
0 |
0 |
0 |
29 |
0 |
0 |
0 |
78 |

An Owen-Type Value for Games with Two-Level Communication Structures |
0 |
0 |
0 |
14 |
0 |
0 |
0 |
66 |

An adjustment process for an exchange economy with linear production technologies |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

An adjustment process for an exchange economy with linear production technologies |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
18 |

An adjustment process for an exchange economy with linear production technologies |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
13 |

An adjustment process for an exchange economy with linear production technologies |
0 |
0 |
0 |
7 |
0 |
0 |
0 |
66 |

An algorithm for the linear complementarity problem with upper and lower bounds |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
24 |

An algorithm for the linear complementarity problem with upper and lower bounds |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
11 |

An algorithm for the linear complementarity problem with upper and lower bounds |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

An efficient format for a problem based introductory economics course |
0 |
0 |
0 |
13 |
0 |
0 |
0 |
158 |

An improvement of fixed point algorithms by using a good triangulation |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |

Associated Consistency Characterization of Two Linear Values for TU Games by Matrix Approach |
0 |
0 |
0 |
26 |
0 |
0 |
0 |
57 |

Asymmetric Nash Solutions in the River Sharing Problem |
0 |
0 |
0 |
41 |
0 |
0 |
2 |
76 |

Axiomatizations of Two Types of Shapley Values for Games on Union Closed Systems |
0 |
0 |
0 |
20 |
0 |
0 |
0 |
87 |

Balanced Simplices on Polytopes |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
25 |

Balanced Simplices on Polytopes |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
2 |

Bertrand Price Competition in a Social Environment |
0 |
0 |
0 |
160 |
0 |
0 |
0 |
858 |

Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games |
0 |
0 |
0 |
24 |
0 |
0 |
0 |
43 |

Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games |
0 |
0 |
0 |
11 |
0 |
0 |
1 |
32 |

Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
16 |
0 |
0 |
0 |
160 |

Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
27 |

Combinatorial integer labeling theorems on finite sets with applications |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
16 |

Comparable Characterizations of Four Solutions for Permission Tree Games |
0 |
0 |
0 |
12 |
0 |
1 |
1 |
36 |

Computation of an industrial equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |

Computation of an industrial equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Computation of an industrial equilibrium |
0 |
0 |
0 |
6 |
0 |
0 |
0 |
114 |

Computation of the Nucleolus for a Class of Disjunctive Games with a Permission Structure |
0 |
0 |
0 |
24 |
0 |
0 |
0 |
116 |

Computing Integral Solutions of Complementarity Problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Computing Integral Solutions of Complementarity Problems |
0 |
0 |
0 |
28 |
0 |
0 |
0 |
229 |

Computing Integral Solutions of Complementarity Problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |

Computing economic equilibria by variable dimension algorithms: State of the art |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |

Computing economic equilibria by variable dimension algorithms: State of the art |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Computing integral solutions of complementarity problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
20 |

Cooperation in a Multi-Dimensional Local Interaction Model |
0 |
0 |
0 |
137 |
0 |
0 |
0 |
747 |

Cooperative Games in Graph Structure |
0 |
0 |
0 |
89 |
0 |
0 |
1 |
605 |

Cooperative Games in Graph Structure |
0 |
0 |
0 |
7 |
0 |
1 |
2 |
45 |

Cooperative Games in Graph Structure |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
4 |

Cooperative games in graph structure |
1 |
1 |
2 |
3 |
1 |
2 |
5 |
10 |

Cooperative games in permutational structure |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
14 |

Core Concepts for Share Vectors |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
11 |

Core Concepts for Share Vectors |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Demand Adjustment in Coalitional Games |
0 |
0 |
0 |
9 |
0 |
0 |
0 |
70 |

Distributing Dividends in Games with Ordered Players |
0 |
0 |
0 |
43 |
0 |
0 |
0 |
130 |

Dynamic Adjustment of Supply Constrained Disequilibria to Walrasian Equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
24 |

Dynamic Adjustment of Supply Constrained Disequilibria to Walrasian Equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Dynamic adjustment of supply constrained disequilibria to Walrasian equilibria |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
17 |

Equilibria with Coordination Failures |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
4 |

Equilibria with Coordination Failures |
0 |
0 |
0 |
1 |
0 |
1 |
1 |
20 |

Equilibria with coordination failures |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
27 |

Equilibrium adjustment of disequilibrium prices |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
19 |

Equilibrium adjustment of disequilibrium prices |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
13 |

Equilibrium adjustment of disequilibrium prices |
0 |
0 |
0 |
6 |
0 |
0 |
0 |
221 |

Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
38 |

Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
10 |
0 |
0 |
0 |
28 |

Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |

Evolutionary Game Theory and the Modelling of Economic Behavior |
0 |
0 |
2 |
916 |
0 |
1 |
7 |
2,394 |

Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible, Indivisible Commodities and Linear Production Technologies |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
18 |

Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible, Indivisible Commodities and Linear Production Technologies |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Existence and approximation of robust stationary points on polytopes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |

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 |
0 |
0 |
13 |

Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money |
0 |
0 |
0 |
4 |
0 |
0 |
1 |
39 |

Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Existence of an equilibrium in a competitive economy with indivisibilities and money |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
18 |

Existence of balanced simplices on polytopes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
13 |

Fair Agreements for Sharing International Rivers with Multiple Springs and Externalities |
0 |
0 |
0 |
55 |
0 |
0 |
0 |
132 |

From Hierarchies to Levels: New Solutions for Games |
0 |
0 |
0 |
17 |
0 |
0 |
1 |
37 |

From Hierarchies to Levels: New Solutions for Games with Hierarchical Structure |
0 |
0 |
0 |
19 |
0 |
0 |
3 |
102 |

From fixed point to equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
11 |

From fixed point to equilibrium |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Games on Union Closed Systems |
0 |
0 |
0 |
14 |
0 |
1 |
2 |
54 |

General Equilibrium in Economies with Infinite Dimensional Commodity Spaces: A Truncation Approach |
0 |
1 |
2 |
63 |
0 |
2 |
5 |
379 |

General equilibrium in a closed international trade model |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
23 |

Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
4 |

Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs |
0 |
0 |
0 |
6 |
0 |
0 |
0 |
32 |

Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs |
0 |
0 |
0 |
4 |
0 |
2 |
4 |
44 |

Harsanyi Power Solutions for Graph-restricted Games |
0 |
0 |
0 |
101 |
0 |
0 |
0 |
465 |

Harsanyi Solutions in Line-graph Games |
0 |
0 |
0 |
106 |
0 |
0 |
0 |
977 |

Independence Axioms for Water Allocation |
0 |
0 |
1 |
22 |
0 |
0 |
1 |
86 |

International Environmental Agreements for River Sharing Problems |
0 |
0 |
0 |
16 |
0 |
0 |
0 |
37 |

International bond markets and the introduction of the euro |
0 |
0 |
0 |
86 |
0 |
0 |
0 |
438 |

Interpretation of the variable dimension fixed point algorithm with an artificial level |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
9 |

Intersection Theorems on the Simplotope |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
102 |

Intersection theorems on polytopes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Intersection theorems on polytopes |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
22 |

Intersection theorems on polytypes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
15 |

Intersection theorems on the simplotope |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
13 |

Intersection theorems on the simplotope |
0 |
0 |
0 |
2 |
1 |
1 |
1 |
5 |

Learning in a Local Interaction Hawk-Dove Game |
0 |
0 |
0 |
81 |
0 |
0 |
1 |
554 |

Measuring the Power of Nodes in Digraphs |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Measuring the Power of Nodes in Digraphs |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
26 |

Measuring the Power of Nodes in Digraphs |
0 |
0 |
0 |
127 |
0 |
0 |
1 |
494 |

Measuring the Power of Nodes in Digraphs |
0 |
0 |
0 |
127 |
0 |
0 |
0 |
603 |

Modelling cooperative games in permutational structure |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Modelling cooperative games in permutational structure |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
20 |

Monotone improvement of the social welfare in an industrial network |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
13 |

Network Formation under Heterogeneous Costs: The Multiple Group Model |
0 |
0 |
0 |
49 |
0 |
0 |
0 |
201 |

Note of the path following approach of equilibrium programming |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
8 |

Note of the path following approach of equilibrium programming |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Note on the path-following approach of equilibrium programming |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
10 |

Note on ‘Competition in Two-sided Markets’ |
0 |
0 |
0 |
120 |
0 |
0 |
3 |
126 |

On Harsanyi Payoff Vectors and the Weber Set |
0 |
0 |
1 |
98 |
0 |
0 |
2 |
336 |

On the Extreme Points of Two Polytopes associated with a Digraph and Applications to Cooperative Games |
0 |
0 |
0 |
26 |
0 |
0 |
1 |
161 |

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 |
0 |
2 |
22 |

On the exclusion from the use of a public good and pareto optimality |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
19 |

On the existence and computation of an equilibrium in an economy with constant returns to scale production |
0 |
0 |
0 |
3 |
0 |
0 |
1 |
19 |

On the existence and computation of an equilibrium in an economy with constant returns to scale production |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

On the existence and computation of an equilibrium in an economy with constant returns to scale production |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |

Optimal Provision of Infrastructure Using Public-Private Partnership Contracts |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Optimal Provision of Infrastructure Using Public-Private Partnership Contracts |
0 |
0 |
0 |
9 |
0 |
0 |
0 |
30 |

Optimal Provision of Infrastructure using Public-Private Partnership Contracts |
0 |
0 |
0 |
327 |
0 |
0 |
0 |
715 |

PRICE RIGIDITIES AND RATIONING |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
374 |

Perfection and Stability of Stationary Points with Applications in Noncooperative Games |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
25 |

Perfection and Stability of Stationary Points with Applications in Noncooperative Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Perfection and Stability of Stationary Points with Applications to Noncooperative Games |
0 |
0 |
0 |
47 |
0 |
0 |
0 |
359 |

Perfection and stability of stationary points with applications to noncooperative games |
0 |
0 |
0 |
8 |
0 |
0 |
0 |
80 |

Potentials and Reduced Games for Share Functions |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |

Potentials and Reduced Games for Share Functions |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
13 |

Price adjustment in a two-country model |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |

Price adjustment in a two-country model |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
14 |

Price adjustment in a two-country model |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
29 |

Price regidities and rationing |
0 |
0 |
0 |
7 |
0 |
0 |
1 |
94 |

Price rigidities and rationing |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
7 |

Price rigidities and rationing |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
18 |

Price-Quantity Adjustment in a Keynesian Economy |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

Price-Quantity Adjustment in a Keynesian Economy |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
21 |

Quantity Constrained Equilibria |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
25 |

Quantity Constrained Equilibria |
0 |
0 |
0 |
39 |
0 |
1 |
2 |
297 |

Quantity Constrained Equilibria |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Quantity constrained equilibria |
0 |
0 |
2 |
33 |
0 |
2 |
30 |
340 |

Share Functions for Cooperative Games with Levels Structure of Cooperation |
0 |
0 |
0 |
15 |
0 |
0 |
0 |
86 |

Shortest paths for simplicial algorithms |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |

Shortest paths for simplicial algorithms |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Signaling devices for the supply of semi-public goods |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
43 |

Signaling devices for the supply of semi-public goods |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Simplical algorithms for finding stationary points, a unifying description |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
17 |

Simplical algorithms for finding stationary points, a unifying description |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Simplicial approximation of solutions to the nonlinear complementarity problem |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
15 |

Simplicial approximation of solutions to the nonlinear complementarity problem |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
9 |

Simplicial approximation of unemployment equilibria |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Socially Structured Games and their Applications |
0 |
0 |
0 |
2 |
0 |
1 |
1 |
31 |

Socially Structured Games and their Applications |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
6 |

Socially structured games |
0 |
0 |
1 |
2 |
0 |
0 |
1 |
28 |

Socially structured games and their applications |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Solution of general equilibrium models with nonconvex technologies |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
32 |

Solving Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Solving Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
54 |
0 |
0 |
0 |
336 |

Solving Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
3 |
0 |
0 |
1 |
36 |

Solving Discrete Zero Point Problems |
0 |
0 |
0 |
22 |
0 |
0 |
1 |
147 |

Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
1 |
35 |
0 |
0 |
1 |
346 |

Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
17 |

Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

Solving discrete systems of nonlinear equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
20 |

Solving discrete zero point problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Solving discrete zero point problems |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
27 |

The (2**(n+1)-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
17 |

The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
19 |

The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria |
0 |
1 |
1 |
1 |
0 |
2 |
3 |
5 |

The Average Tree Permission Value for Games with a Permission Tree |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
39 |

The Average Tree Permission Value for Games with a Permission Tree |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
7 |

The Average Tree Permission Value for Games with a Permission Tree |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
38 |

The Average Tree Solution for Cooperative Games with Communication Structure |
0 |
0 |
0 |
62 |
0 |
0 |
1 |
283 |

The Average Tree Solution for Cooperative Games with Communication Structure |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

The Average Tree Solution for Cooperative Games with Communication Structure |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
19 |

The Average Tree permission value for games with a permission tree |
0 |
0 |
0 |
22 |
0 |
0 |
0 |
32 |

The Component Fairness Solution for Cycle-Free Graph Games |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
5 |

The Component Fairness Solution for Cycle-Free Graph Games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |

The Component Fairness Solution for Cycle-free Graph Games |
0 |
0 |
0 |
30 |
0 |
0 |
0 |
359 |

The Harsanyi Set for Cooperative TU-Games |
0 |
0 |
0 |
74 |
0 |
1 |
2 |
213 |

The Normalized Banzhaf Value and the Banzhaf Share Function |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

The Normalized Banzhaf Value and the Banzhaf Share Function |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
20 |

The Restricted Core for Totally Positive Games with Ordered Players |
0 |
0 |
0 |
55 |
0 |
0 |
1 |
151 |

The Reverse Talmud Rule for Bankruptcy Problems |
0 |
0 |
0 |
102 |
0 |
0 |
1 |
485 |

The Socially Stable Core in Structured Transferable Utility Games |
0 |
0 |
0 |
2 |
1 |
2 |
2 |
25 |

The Socially Stable Core in Structured Transferable Utility Games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
4 |

The Socially Stable Core in Structured Transferable Utility Games |
0 |
0 |
0 |
42 |
0 |
0 |
0 |
254 |

The Tort Law and the Nucleolus for Generalized Joint Liability Problems |
1 |
1 |
1 |
20 |
1 |
1 |
1 |
29 |

The Transition from a Drèze Equilibrium to a Walrasian Equilibrium |
0 |
0 |
1 |
94 |
1 |
1 |
3 |
590 |

The average tree permission value for games with a permission tree |
0 |
0 |
0 |
44 |
0 |
0 |
0 |
92 |

The average tree solution for cooperative games with communication structure |
0 |
0 |
0 |
36 |
0 |
0 |
0 |
149 |

The average tree solution for cooperative games with communication structure |
0 |
0 |
0 |
7 |
0 |
0 |
0 |
34 |

The average tree solution for cycle-free graph games |
0 |
0 |
0 |
11 |
0 |
0 |
0 |
45 |

The average tree solution for cycle-free graph games |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
22 |

The component fairness solution for cycle-free graph games |
0 |
0 |
0 |
196 |
0 |
0 |
0 |
957 |

The feasibility of a fixed exchange rate regime for new EU-members: evidence from real exchange rates |
0 |
0 |
0 |
74 |
0 |
0 |
0 |
422 |

The number of ways to construct a connected graph: A graph-based generalization of the binomial coefficients |
0 |
0 |
1 |
2 |
0 |
0 |
4 |
5 |

The online target date assignment problem |
0 |
0 |
0 |
56 |
0 |
0 |
1 |
764 |

The socially stable core in structured transferable utility games |
0 |
0 |
0 |
61 |
0 |
0 |
0 |
927 |

The socially stable core in structured transferable utility games |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
8 |

The weak sequential core for two-period economies |
0 |
0 |
0 |
302 |
0 |
0 |
1 |
1,082 |

Transboundary Externalities and Property Rights: An International River Pollution Model |
0 |
0 |
0 |
67 |
0 |
0 |
1 |
299 |

Two Values for Transferable Utility Games with Coalition and Graph Structure |
0 |
0 |
0 |
6 |
0 |
0 |
0 |
39 |

Van vast punt tot evenwicht |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
11 |

Variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using general labelling |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
17 |

Variable dimension algorithms for unproper labellings |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Variable dimension algorithms for unproper labellings |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
21 |

Total Working Papers |
2 |
5 |
20 |
5,266 |
9 |
33 |
166 |
25,993 |