default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Social Sciences, Volume 56
Volume 56, Number 1, July 2008
- Andrés Perea:
Minimal belief revision leads to backward induction. 1-26 - Yannick Viossat:
Evolutionary dynamics may eliminate all strategies used in correlated equilibrium. 27-43 - Jérôme Renault, Sergio Scarlatti
, Marco Scarsini:
Discounted and finitely repeated minority games with public signals. 44-74 - Andrea Attar, Dipjyoti Majumdar, Gwenaël Piaser, Nicolás Porteiro:
Common agency games: Indifference and separable preferences. 75-95 - Luis A. Guardiola, Ana Meca, Justo Puerto:
Production-inventory games and PMAS-games: Characterizations of the Owen point. 96-108 - Hung-Ju Chen, Ming-Chia Li:
Productive public expenditures, expectation formations and nonlinear dynamics. 109-126 - Vera Tilson:
Monotonicity properties of wholesale price contracts. 127-143 - Ali al-Nowaihi, Sanjit Dhami:
Corrigendum to "A note on the Loewenstein-Prelec theory of intertemporal choice" [Math. Social Sciences 52 (1) (2006) 99-108]. 144-147
Volume 56, Number 2, September 2008
- Sergei Ovchinnikov:
Cubical token systems. 149-165 - Norbert Gaffke, Friedrich Pukelsheim:
Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems. 166-184 - Zaier Aouani, Alain Chateauneuf:
Exact capacities and star-shaped distorted probabilities. 185-194 - Nikolai S. Kukushkin:
Maximizing an interval order on compact subsets of its domain. 195-206 - Jérôme Renault, Marco Scarsini, Tristan Tomala:
Playing off-line games with bounded rationality. 207-223 - Gerhard J. Woeginger:
An axiomatic characterization of the Hirsch-index. 224-232 - Travis Lee:
Benchmarking the effective literacy rate. 233-239 - Horst F. Niemeyer, Alice C. Niemeyer:
Apportionment methods. 240-253 - Felix Brandt, Felix A. Fischer:
Computing the minimal covering set. 254-268 - Rafael Amer, José Miguel Giménez:
A general procedure to compute mixed modified semivalues for cooperative games with structure of coalition blocks. 269-282 - Michael McBride:
Position-specific information in social networks: Are you connected? 283-295 - Sonali Roy:
The exact lower bound for the Coleman index of the power of a collectivity for a special class of simple majority games. 296-300
Volume 56, Number 3, November 2008
- Sylvain Béal, Jacques Durieu, Philippe Solal:
Farsighted coalitional stability in TU-games. 303-313 - Francesca Centrone, Claudia Meo:
Coalition formation in games without side payments. 314-320 - Yan-An Hwang, Yu-Hsien Liao:
Potential approach and characterizations of a Shapley value in multi-choice games. 321-335 - Yoshio Kamijo:
Implementation of weighted values in hierarchical and horizontal cooperation structures. 336-349 - Tommy Andersson, Lars-Gunnar Svensson:
Non-manipulable assignment of individuals to positions revisited. 350-354 - Humberto Llavador:
Voting with preferences over margins of victory. 355-365 - Volker Hahn:
Committees, sequential voting and transparency. 366-385 - Martin Rechenauer:
On the non-equivalence of weak and strict preference. 386-388 - Özgür Yilmaz:
Utility representation of lower separable preferences. 389-394 - Penélope Hernández, Amparo Urbano:
Codification schemes and finite automata. 395-409 - Giorgos Stamatopoulos, Yair Tauman:
Licensing of a quality-improving innovation. 410-438 - Jean-Michel Courtault, Bertrand Crettez, Naïla Hayek:
A note on Boiteux' surplus function and dual Pareto efficiency. 439-447 - Antonio Miralles:
Intuitive and noncompetitive equilibria in weakly efficient auctions with entry costs. 448-455
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-08 22:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
