default search action
László Á. Kóczy
Person information
- affiliation: Hungarian Academy of Sciences, Institute of Economics, Budapest, Hungary
- affiliation: Budapest University of Technology and Economics, Department of Finance, Budapest, Hungary
- affiliation: Óbuda University, Keleti Faculty of Business and Management, Budapest, Hungary
- affiliation: Budapest Tech, Keleti Faculty of Economics, Budapest, Hungary
- affiliation: Maastricht University, Department of Economics, Maastricht, The Netherlands
- affiliation (PhD 2003): KU Leuven, Center for Economic Studies, Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j17]László Á. Kóczy
:
Core-stability over networks with widespread externalities. Ann. Oper. Res. 318(2): 1001-1027 (2022) - [j16]Dóra Gréta Petróczy
Exits from the European Union and Their Effect on Power Distribution in the Council. Games 13(1): 18 (2022) - 2021
- [j15]László Á. Kóczy
Brexit and Power in the Council of the European Union. Games 12(2): 51 (2021) - [j14]P. Jean-Jacques Herings
The equivalence of the minimal dominant set and the myopic stable set for coalition function form games. Games Econ. Behav. 127: 67-79 (2021) - [j13]Jochen Staudacher
Computing power indices for weighted voting games via dynamic programming. Oper. Res. Decis. 31(2) (2021)
2010 – 2019
- 2018
- [j12]László Á. Kóczy
Bounds on Malapportionment. Oper. Res. Lett. 46(3): 324-328 (2018) - 2015
- [j11]Ferenc Forgó, László Á. Kóczy
Editorial. Central Eur. J. Oper. Res. 23(4): 723-725 (2015) - [j10]Péter Biró, László Á. Kóczy
Fair apportionment in the view of the Venice Commission's recommendation. Math. Soc. Sci. 77: 32-41 (2015) - 2013
- [j9]Fabien Lange, László Á. Kóczy
Power indices expressed in terms of minimal winning coalitions. Soc. Choice Welf. 41(2): 281-292 (2013) - 2012
- [j8]László Á. Kóczy
Beyond Lisbon: Demographic trends and voting power in the European Union Council of Ministers. Math. Soc. Sci. 63(2): 152-158 (2012) - 2011
- [j7]Péter Csóka, P. Jean-Jacques Herings
Convex and exact games with non-transferable utility. Eur. J. Oper. Res. 209(1): 57-62 (2011) - [j6]Péter Csóka, P. Jean-Jacques Herings
Balancedness conditions for exact games. Math. Methods Oper. Res. 74(1): 41-52 (2011)
2000 – 2009
- 2009
- [j5]László Á. Kóczy
Sequential coalition formation and the core in the presence of externalities. Games Econ. Behav. 66(1): 559-565 (2009) - [j4]Péter Csóka, P. Jean-Jacques Herings
Stable allocations of risk. Games Econ. Behav. 67(1): 266-276 (2009) - [j3]László Á. Kóczy
The invariant method can be manipulated. Scientometrics 81(1): 291-293 (2009) - [p1]László Á. Kóczy
Measuring Voting Power: The Paradox of New Members vs. the Null Player Axiom. Towards Intelligent Engineering and Information Technology 2009: 67-78 - 2007
- [j2]László Á. Kóczy
The minimal dominant set is a non-empty core-extension. Games Econ. Behav. 61(2): 277-298 (2007) - 2004
- [j1]László Á. Kóczy
The coalition structure core is accessible. Games Econ. Behav. 48(1): 86-93 (2004)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST 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: