| 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 |
39 |
0 |
0 |
1 |
121 |
| A Competitive Partnership Formation Process |
0 |
0 |
0 |
0 |
2 |
4 |
5 |
13 |
| A Competitive Partnership Formation Process |
0 |
0 |
0 |
55 |
0 |
0 |
2 |
168 |
| A Competitive Partnership Formation Process |
0 |
0 |
0 |
20 |
1 |
2 |
4 |
63 |
| A Conic Approach to the Implementation of Reduced-Form Allocation Rules |
0 |
1 |
2 |
28 |
0 |
1 |
2 |
82 |
| 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 |
1 |
1 |
56 |
| A Double-Track Auction for Substitutes and Complements |
0 |
0 |
1 |
86 |
3 |
3 |
6 |
399 |
| A Dynamic Auction for Differentiated Items under Price Rigidities |
0 |
0 |
0 |
6 |
0 |
1 |
2 |
35 |
| A Dynamic Auction for Differentiated Items under Price Rigidities |
0 |
0 |
0 |
0 |
2 |
3 |
3 |
8 |
| A Fixed Point Theorem for Discontinuous Functions |
0 |
0 |
0 |
3 |
0 |
1 |
3 |
34 |
| A Fixed Point Theorem for Discontinuous Functions |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
13 |
| A Fixed Point Theorem for Discontinuous Functions |
0 |
0 |
0 |
83 |
0 |
1 |
4 |
440 |
| A General Existence Thorem of Zero Points |
0 |
0 |
0 |
3 |
0 |
0 |
2 |
29 |
| A General Existence Thorem of Zero Points |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |
| A Model of Partnership Formation |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
6 |
| A Model of Partnership Formation |
0 |
0 |
0 |
16 |
0 |
0 |
1 |
51 |
| A Practical Competitive Market Model for Indivisible Commo |
0 |
0 |
0 |
200 |
0 |
0 |
1 |
1,422 |
| A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
5 |
| A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex |
0 |
0 |
0 |
1 |
0 |
1 |
1 |
7 |
| A Theory of Marriage with Mutually Consented Divorces |
0 |
0 |
1 |
87 |
2 |
6 |
11 |
418 |
| A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities |
0 |
0 |
4 |
58 |
1 |
2 |
11 |
114 |
| A constructive proof of Ky Fan's coincidence theorem |
0 |
0 |
1 |
5 |
0 |
0 |
1 |
13 |
| A constructive proof of a unimodular transformation theorem for simplices |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
6 |
| A constructive proof of a unimodular transformation theorem for simplices |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
2 |
| A discrete multivariate mean value theorem with applications |
0 |
0 |
0 |
2 |
2 |
2 |
2 |
14 |
| A dynamic auction for differentiated items under price rigidity |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
13 |
| A fixed point theorem for discontinuous functions |
0 |
0 |
1 |
101 |
0 |
0 |
12 |
420 |
| A fixed point theorem for discontinuous functions |
0 |
0 |
0 |
1 |
1 |
1 |
2 |
26 |
| A fixed point theorem for discontinuous functions |
0 |
0 |
0 |
2 |
0 |
1 |
1 |
32 |
| A general existence theorem of zero points |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
8 |
| A general existence theorem of zero points |
0 |
0 |
0 |
1 |
3 |
3 |
3 |
37 |
| A general strategy proof fair allocation mechanism |
0 |
0 |
0 |
9 |
0 |
0 |
0 |
67 |
| 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 |
5 |
0 |
0 |
1 |
17 |
| A simplicial algorithm for computing proper Nash equilibria of finite games |
0 |
0 |
1 |
1 |
0 |
0 |
4 |
5 |
| A simplicial algorithm for testing the integral properties of polytopes: A revision |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
| 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 property of a polytope |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
7 |
| A simplicial algorithm for testing the integral property of a polytope |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
| A vector labeling method for solving discrete zero point and complementarity problems |
0 |
0 |
0 |
0 |
2 |
2 |
3 |
20 |
| An Ascending Multi-Item Auction with Financially Constrained Bidders |
0 |
0 |
1 |
46 |
2 |
3 |
4 |
158 |
| An Ascending Multi-Item Auction with Financially Constrained Bidders |
0 |
0 |
0 |
62 |
0 |
1 |
3 |
199 |
| 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 |
35 |
1 |
1 |
2 |
101 |
| An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
7 |
| An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders |
0 |
0 |
0 |
5 |
2 |
3 |
5 |
41 |
| An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements |
0 |
0 |
1 |
98 |
2 |
3 |
7 |
275 |
| An Efficient and Strategy-Proof Double-Track Auction for Substitutes and Complements |
0 |
0 |
1 |
35 |
0 |
0 |
2 |
51 |
| An Exploration of a Strategic Competition Model for the European Union Natural Gas Market |
0 |
1 |
1 |
95 |
1 |
3 |
4 |
115 |
| Balanced Simplices on Polytopes |
0 |
0 |
0 |
2 |
1 |
1 |
1 |
26 |
| Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations |
0 |
0 |
1 |
17 |
1 |
1 |
5 |
165 |
| Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
7 |
| Combinatorial Integer Labeling Thorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
29 |
| 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 |
1 |
20 |
| Competitive Outcomes and Endogenous Coalition Formation in an n-Person Game |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
13 |
| Competitive outcomes and endogenous coalition formation in an n-person game |
0 |
0 |
1 |
65 |
1 |
2 |
3 |
116 |
| Computing Integral Solutions of Complementarity Problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
| Computing Integral Solutions of Complementarity Problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |
| Computing Integral Solutions of Complementarity Problems |
0 |
0 |
0 |
28 |
1 |
2 |
2 |
232 |
| Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items |
0 |
0 |
0 |
31 |
1 |
1 |
2 |
125 |
| Computing integral solutions of complementarity problems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
20 |
| Cooperative games in permutational structure |
0 |
0 |
0 |
1 |
0 |
1 |
2 |
16 |
| Decentralised Random Competitive Dynamic Market Processes |
0 |
0 |
0 |
21 |
0 |
0 |
0 |
99 |
| Decentralized Market Processes to Stable Job Matchings with Competitive Salaries |
0 |
0 |
1 |
83 |
1 |
1 |
3 |
263 |
| Decentralized Market Processes to Stable Job Matchings with Competitive Salaries |
0 |
0 |
0 |
46 |
1 |
1 |
2 |
144 |
| Efficiency, Stability, and Commitment in Senior Level Job Matching Markets |
0 |
0 |
0 |
37 |
0 |
0 |
1 |
83 |
| Efficient Ascending Menu Auctions with Budget Constrained Bidders |
0 |
0 |
0 |
17 |
0 |
4 |
4 |
64 |
| Efficient Kidney Exchange with Dichotomous Preferences |
0 |
1 |
7 |
87 |
2 |
6 |
31 |
219 |
| Efficient Sequential Assignments with Randomly Arriving Multi-Item Demand Agents |
0 |
0 |
0 |
12 |
0 |
1 |
1 |
31 |
| Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
10 |
0 |
1 |
2 |
30 |
| Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
5 |
1 |
1 |
3 |
41 |
| Equilibrium in the Assignment Market under Budget Constraints |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
10 |
| Equilibrium, Auction, Multiple Substitutes and Complements |
0 |
0 |
0 |
35 |
0 |
0 |
3 |
159 |
| 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 |
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 |
1 |
4 |
| 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 |
1 |
13 |
| Existence and welfare properties of equilibrium in an exchange economy with multiple divisible and indivisible commodities and linear production |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
15 |
| Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
5 |
| Existence of an Equilibrium in a Competitive Economy with Indivisibilities and Money |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
39 |
| Existence of an equilibrium in a competitive economy with indivisibilities and money |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
20 |
| Existence of balanced simplices on polytopes |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
14 |
| Herbert Scarf: a Distinguished American Economist |
0 |
0 |
0 |
17 |
1 |
3 |
5 |
124 |
| How to Efficiently Allocate Houses under Price Controls? |
0 |
0 |
0 |
71 |
2 |
2 |
4 |
108 |
| How to Efficiently Allocate Houses under Price Controls? |
0 |
0 |
1 |
55 |
2 |
2 |
5 |
94 |
| Intersection theorems on polytopes |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
22 |
| Intersection theorems on polytopes |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
4 |
| Intersection theorems on polytypes |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
15 |
| Markovian Core, Indivisibility, and Successive Pareto-Improvements |
0 |
0 |
0 |
23 |
0 |
3 |
5 |
51 |
| Modelling cooperative games in permutational structure |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
| 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 |
143 |
| On a Fundamental Property of Talman-Yang's Auction under Price Control |
0 |
0 |
2 |
21 |
0 |
0 |
5 |
120 |
| On a parameterized system of nonlinear equations with economic applications |
0 |
0 |
0 |
3 |
0 |
0 |
1 |
20 |
| On the Connectedness of Coincidences and Zero Points of Mappings |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
15 |
| On the Connectedness of Coincidences and Zero Points of Mappings |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
4 |
| Perfection and Stability of Stationary Points with Applications in Noncooperative Games |
0 |
0 |
0 |
3 |
1 |
1 |
1 |
27 |
| Perfection and Stability of Stationary Points with Applications in Noncooperative Games |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
4 |
| Perfection and Stability of Stationary Points with Applications to Noncooperative Games |
0 |
0 |
1 |
48 |
0 |
0 |
1 |
360 |
| Rational Addictive Behavior under Uncertainty |
0 |
0 |
0 |
132 |
0 |
1 |
4 |
249 |
| Revisiting Jansen et al.'s Modified Cournot Model of the European Union Natural Gas Market |
0 |
0 |
0 |
54 |
5 |
6 |
7 |
138 |
| Simplicial fixed point algorithms and applications |
0 |
0 |
0 |
6 |
0 |
1 |
1 |
26 |
| Solving Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
| Solving Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
54 |
2 |
2 |
2 |
338 |
| Solving Discrete Systems of Nonlinear Equations |
0 |
0 |
0 |
3 |
2 |
2 |
4 |
40 |
| Solving Discrete Zero Point Problems |
0 |
0 |
0 |
22 |
2 |
2 |
2 |
149 |
| Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
35 |
1 |
1 |
1 |
347 |
| Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
18 |
| Solving Discrete Zero Point Problems with Vector Labeling |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
| Solving discrete systems of nonlinear equations |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
20 |
| Solving discrete zero point problems |
0 |
0 |
0 |
1 |
1 |
2 |
3 |
30 |
| Solving discrete zero point problems |
0 |
0 |
0 |
0 |
2 |
2 |
2 |
3 |
| Supplements A, B and C to “Efficient Kidney Exchange with Dichotomous Preferences” |
0 |
0 |
0 |
36 |
0 |
2 |
2 |
57 |
| Surjective Function Theorems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
| Surjective Function Theorems |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
37 |
| 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 |
1 |
1 |
2 |
7 |
| The Average Tree Solution for Cooperative Games with Communication Structure |
0 |
0 |
1 |
63 |
0 |
0 |
2 |
285 |
| The Average Tree Solution for Cooperative Games with Communication Structure |
0 |
0 |
0 |
0 |
0 |
2 |
2 |
7 |
| The Average Tree Solution for Cooperative Games with Communication Structure |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
20 |
| The Computation of a Coincidence of Two Mappings |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
| The Computation of a Coincidence of Two Mappings |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |
| The Max-Convolution Approach to Equilibrium Models with Indivisibilities |
0 |
0 |
0 |
1 |
1 |
1 |
2 |
248 |
| The average tree solution for cooperative games with communication structure |
0 |
0 |
0 |
7 |
0 |
0 |
1 |
36 |
| The average tree solution for cooperative games with communication structure |
0 |
0 |
0 |
36 |
0 |
0 |
1 |
150 |
| 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 |
0 |
8 |
1 |
1 |
2 |
48 |
| Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis |
0 |
0 |
0 |
20 |
1 |
1 |
2 |
93 |
| Variational Inequality Problems With a Continuum of Solutions: Existence and Computation |
0 |
0 |
0 |
1 |
0 |
2 |
2 |
6 |
| Variational Inequality Problems With a Continuum of Solutions: Existence and Computation |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
17 |
| Variational inequality problems with a continuum of solutions: Existence and computation |
0 |
0 |
0 |
2 |
2 |
4 |
4 |
21 |
| Total Working Papers |
0 |
3 |
30 |
2,497 |
75 |
130 |
297 |
10,898 |