Working Paper |
File Downloads |
Abstract Views |

Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |

A Competitive Partnership Formation Process |
0 |
0 |
0 |
55 |
0 |
0 |
2 |
166 |

A Competitive Partnership Formation Process |
0 |
0 |
0 |
39 |
0 |
0 |
0 |
120 |

A Competitive Partnership Formation Process |
0 |
0 |
0 |
20 |
0 |
0 |
0 |
58 |

A Competitive Partnership Formation Process |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
8 |

A Conic Approach to the Implementation of Reduced-Form Allocation Rules |
0 |
0 |
0 |
26 |
0 |
2 |
2 |
80 |

A Discrete Multivariate Mean Value Theorem with Applications |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

A Discrete Multivariate Mean Value Theorem with Applications |
0 |
0 |
0 |
5 |
1 |
3 |
5 |
54 |

A Double-Track Auction for Substitutes and Complements |
0 |
0 |
1 |
85 |
0 |
1 |
4 |
391 |

A Dynamic Auction for Differentiated Items under Price Rigidities |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

A Dynamic Auction for Differentiated Items under Price Rigidities |
0 |
0 |
0 |
6 |
0 |
0 |
0 |
33 |

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

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

A General Existence Thorem of Zero Points |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

A General Existence Thorem of Zero Points |
0 |
0 |
0 |
3 |
0 |
1 |
1 |
26 |

A Model of Partnership Formation |
0 |
0 |
0 |
16 |
0 |
0 |
2 |
50 |

A Model of Partnership Formation |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
4 |

A Practical Competitive Market Model for Indivisible Commo |
0 |
0 |
0 |
200 |
0 |
0 |
0 |
1,421 |

A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
4 |

A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
6 |

A Theory of Marriage with Mutually Consented Divorces |
0 |
0 |
2 |
86 |
0 |
2 |
15 |
403 |

A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities |
0 |
0 |
5 |
53 |
0 |
2 |
12 |
100 |

A constructive proof of Ky Fan's coincidence theorem |
0 |
0 |
1 |
4 |
0 |
0 |
3 |
12 |

A constructive proof of a unimodular transformation theorem for simplices |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

A constructive proof of a unimodular transformation theorem for simplices |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

A discrete multivariate mean value theorem with applications |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
12 |

A dynamic auction for differentiated items under price rigidity |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
11 |

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

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

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

A general existence theorem of zero points |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

A general existence theorem of zero points |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
34 |

A general strategy proof fair allocation mechanism |
0 |
0 |
0 |
8 |
0 |
0 |
1 |
65 |

A new variable dimension simplicial algorithm for computing economic equilibria on S**n x R**m+ |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
6 |

A simplicial algorithm for computing proper Nash equilibria of finite games |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

A simplicial algorithm for computing proper Nash equilibria of finite games |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
16 |

A simplicial algorithm for testing the integral properties of polytopes: A revision |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
13 |

A simplicial algorithm for testing the integral properties of polytopes: A revision |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

A simplicial algorithm for testing the integral property of a polytope |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |

A simplicial algorithm for testing the integral property of a polytope |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
6 |

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

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

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

An Efficient Double-Track Auction for Substitutes and Complements |
0 |
0 |
0 |
30 |
0 |
0 |
0 |
101 |

An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders |
0 |
0 |
0 |
35 |
0 |
0 |
0 |
99 |

An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
36 |

An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements |
0 |
0 |
2 |
97 |
0 |
0 |
4 |
266 |

An Efficient and Strategy-Proof Double-Track Auction for Substitutes and Complements |
0 |
0 |
0 |
34 |
0 |
0 |
2 |
48 |

An Exploration of a Strategic Competition Model for the European Union Natural Gas Market |
0 |
0 |
0 |
94 |
0 |
0 |
2 |
111 |

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

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 |

Competitive Outcomes and Endogenous Coalition Formation in an n-Person Game |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
19 |

Competitive Outcomes and Endogenous Coalition Formation in an n-Person Game |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
11 |

Competitive outcomes and endogenous coalition formation in an n-person game |
0 |
1 |
1 |
64 |
0 |
1 |
3 |
113 |

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

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

Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items |
0 |
1 |
2 |
31 |
0 |
1 |
3 |
121 |

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

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

Decentralised Random Competitive Dynamic Market Processes |
0 |
1 |
1 |
21 |
0 |
1 |
2 |
98 |

Decentralized Market Processes to Stable Job Matchings with Competitive Salaries |
0 |
0 |
1 |
46 |
0 |
1 |
4 |
142 |

Decentralized Market Processes to Stable Job Matchings with Competitive Salaries |
0 |
0 |
0 |
82 |
1 |
1 |
3 |
259 |

Efficiency, Stability, and Commitment in Senior Level Job Matching Markets |
0 |
0 |
0 |
37 |
0 |
0 |
1 |
82 |

Efficient Ascending Menu Auctions with Budget Constrained Bidders |
0 |
0 |
0 |
17 |
0 |
0 |
1 |
60 |

Efficient Kidney Exchange with Dichotomous Preferences |
0 |
0 |
2 |
80 |
0 |
2 |
10 |
187 |

Efficient Sequential Assignments with Randomly Arriving Multi-Item Demand Agents |
0 |
0 |
0 |
12 |
0 |
0 |
3 |
30 |

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 |

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

Equilibrium, Auction, Multiple Substitutes and Complements |
0 |
0 |
0 |
35 |
0 |
0 |
3 |
156 |

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

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

Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production |
0 |
0 |
0 |
0 |
0 |
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 |

Herbert Scarf: a Distinguished American Economist |
0 |
0 |
0 |
17 |
0 |
0 |
4 |
117 |

How to Efficiently Allocate Houses under Price Controls? |
0 |
0 |
0 |
71 |
0 |
0 |
0 |
104 |

How to Efficiently Allocate Houses under Price Controls? |
0 |
0 |
0 |
54 |
0 |
0 |
2 |
89 |

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 |

Markovian Core, Indivisibility, and Successive Pareto-Improvements |
0 |
0 |
1 |
23 |
0 |
0 |
3 |
45 |

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 |

On Revealed Preference and Indivisibilities |
0 |
0 |
0 |
36 |
0 |
0 |
1 |
142 |

On a Fundamental Property of Talman-Yang's Auction under Price Control |
0 |
0 |
0 |
19 |
0 |
0 |
0 |
115 |

On a parameterized system of nonlinear equations with economic applications |
0 |
0 |
0 |
3 |
0 |
0 |
2 |
17 |

On the Connectedness of Coincidences and Zero Points of Mappings |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
14 |

On the Connectedness of Coincidences and Zero Points of Mappings |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
3 |

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 in Noncooperative Games |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
25 |

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

Rational Addictive Behavior under Uncertainty |
0 |
0 |
0 |
132 |
0 |
0 |
5 |
243 |

Revisiting Jansen et al.'s Modified Cournot Model of the European Union Natural Gas Market |
0 |
0 |
0 |
54 |
0 |
1 |
1 |
131 |

Simplicial fixed point algorithms and applications |
0 |
0 |
1 |
6 |
0 |
0 |
1 |
25 |

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 Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

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

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

Supplements A, B and C to “Efficient Kidney Exchange with Dichotomous Preferences” |
0 |
0 |
0 |
36 |
0 |
0 |
0 |
55 |

Surjective Function Theorems |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
37 |

Surjective Function Theorems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

The (2n+m+1-2)-ray algorithm: a new variable dimension simplicial algorithm for computing economic equilibria on Sn×Rm+ |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
13 |

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

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

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

The Computation of a Coincidence of Two Mappings |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |

The Computation of a Coincidence of Two Mappings |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |

The Max-Convolution Approach to Equilibrium Models with Indivisibilities |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
246 |

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 computation of a continuum of constrained equilibria |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
14 |

The max convolution approach to equilibrium analysis |
0 |
0 |
2 |
8 |
0 |
0 |
3 |
45 |

Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis |
0 |
0 |
0 |
20 |
0 |
0 |
0 |
91 |

Variational Inequality Problems With a Continuum of Solutions: Existence and Computation |
0 |
0 |
1 |
1 |
0 |
0 |
2 |
4 |

Variational Inequality Problems With a Continuum of Solutions: Existence and Computation |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
15 |

Variational inequality problems with a continuum of solutions: Existence and computation |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
17 |

Total Working Papers |
0 |
4 |
27 |
2,465 |
3 |
23 |
147 |
10,563 |