Similar Search Results

Kasberger, Bernhard; Martin, Simon; Normann, Hans-Theo; … - 2023

artificial intelligence may or may not be cooperative. We study the determinants and forms of algorithmic cooperation in the … prisoner's dilemma games played by humans in the lab. We find that the same factors that increase human cooperation largely … also determine the cooperation rates of algorithms. However, algorithms tend to play different strategies than humans …

Persistent link: https://www.econbiz.de/10014358527

Optimal Information Disclosure : A Linear Programming Approach

Kolotilin, Anton - 2016

An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single-crossing assumption, so that the receiver with a higher type is more willing to act. Using a linear programming approach, I...

Persistent link: https://www.econbiz.de/10012979703

A model of partnership fornmation

Talman, Dolf (contributor); Yang, Zaifu (contributor) - 2008

Persistent link: https://www.econbiz.de/10003807125

Non constant sum and R+S player extensions of the linear programming representation of two person constant sum games

Ryan, Michael J. - In: Homo oeconomicus 22 (2005) 3, pp. 401-424

Persistent link: https://www.econbiz.de/10003264418

Monotone Comparative Statics with Separable Objective Functions

Ewerhart, Christian - 2010

The sum of a supermodular function, assumed nondecreasing in the choice variable, and of a 'concavely supermodularizable' function, assumed nonincreasing in the parameter variable, satisfies the Milgrom- Shannon (1994, Monotone comparative statics, Econometrica 62, 157-180) single crossing...

Persistent link: https://www.econbiz.de/10014197826

Solving Discrete Systems of Nonlinear Equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice of the n-dimensional Euclidean space. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that...

Persistent link: https://www.econbiz.de/10014206228

Solving discrete systems of nonlinear equations

Laan, Gerard van der (contributor); Talman, Dolf (contributor) - 2008

Persistent link: https://www.econbiz.de/10003807167

Combinatorial integer labeling theorems on finite sets with an application to discrete systems of nonlinear equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2007

Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...

Persistent link: https://www.econbiz.de/10011373836

Computing integral solutions of complementarity problems

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2004

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm...

Persistent link: https://www.econbiz.de/10011343323

Solving discrete systems of nonlinear equations

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - 2009

Persistent link: https://www.econbiz.de/10011378347